@InProceedings{chan:LIPIcs.SOCG.2015.733,
  author =	{Chan, Timothy M.},
  title =	{{A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions}},
  booktitle =	{31st International Symposium on Computational Geometry (SoCG 2015)},
  pages =	{733--738},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-83-5},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{34},
  editor =	{Arge, Lars and Pach, J\'{a}nos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.733},
  URN =		{urn:nbn:de:0030-drops-51415},
  doi =		{10.4230/LIPIcs.SOCG.2015.733},
  annote =	{Keywords: convex polyhedra, intersection, Dobkin–Kirkpatrick hierarchy}
}