Combinatorial complexity of translating a box in polyhedral 3-space

Dan Halperin, Chee Keng Yap

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We study the space of free translations of a box amidst polyhedral obstacles with n features. We show that the combinatorial complexity of this space is O(n2α(n)) where α(n) is the inverse Ackermann function. Our bound is within an α(n) factor off the lower bound, and it constitutes an improvement of almost an order of magnitude over the best previously known (and naive) bound for this problem, O(n3).

Original languageEnglish (US)
Title of host publicationProceedings of the 9th Annual Symposium on Computational Geometry
PublisherPubl by ACM
Pages29-37
Number of pages9
ISBN (Print)0897915828, 9780897915823
DOIs
StatePublished - 1993
EventProceedings of the 9th Annual Symposium on Computational Geometry - San Diego, CA, USA
Duration: May 19 1993May 21 1993

Publication series

NameProceedings of the 9th Annual Symposium on Computational Geometry

Other

OtherProceedings of the 9th Annual Symposium on Computational Geometry
CitySan Diego, CA, USA
Period5/19/935/21/93

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Halperin, D., & Yap, C. K. (1993). Combinatorial complexity of translating a box in polyhedral 3-space. In Proceedings of the 9th Annual Symposium on Computational Geometry (pp. 29-37). (Proceedings of the 9th Annual Symposium on Computational Geometry). Publ by ACM. https://doi.org/10.1145/160985.160992