License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.733
URN: urn:nbn:de:0030-drops-51415
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5141/
Go to the corresponding LIPIcs Volume Portal

Chan, Timothy M.

A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions

pdf-format:
58.pdf (0.3 MB)

Abstract

Chazelle [FOCS'89] gave a linear-time algorithm to compute the intersection of two convex polyhedra in three dimensions. We present a simpler algorithm to do the same.

BibTeX - Entry

@InProceedings{chan:LIPIcs:2015:5141,
  author =	{Timothy M. Chan},
  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 =	{Lars Arge and J{\'a}nos Pach},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5141},
  URN =		{urn:nbn:de:0030-drops-51415},
  doi =		{10.4230/LIPIcs.SOCG.2015.733},
  annote =	{Keywords: convex polyhedra, intersection, Dobkin–Kirkpatrick hierarchy}
}

Keywords: convex polyhedra, intersection, Dobkin–Kirkpatrick hierarchy
Collection: 31st International Symposium on Computational Geometry (SoCG 2015)
Issue Date: 2015
Date of publication: 12.06.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI