Combinatorial complexity of translating a box in polyhedral 3-space

Dan Halperin, Chee 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(n 2α(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(n 3).

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

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. (1993). Combinatorial complexity of translating a box in polyhedral 3-space. In Anon (Ed.), Proceedings of the 9th Annual Symposium on Computational Geometry (pp. 29-37). Publ by ACM.

Combinatorial complexity of translating a box in polyhedral 3-space. / Halperin, Dan; Yap, Chee.

Proceedings of the 9th Annual Symposium on Computational Geometry. ed. / Anon. Publ by ACM, 1993. p. 29-37.

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

Halperin, D & Yap, C 1993, Combinatorial complexity of translating a box in polyhedral 3-space. in Anon (ed.), Proceedings of the 9th Annual Symposium on Computational Geometry. Publ by ACM, pp. 29-37, Proceedings of the 9th Annual Symposium on Computational Geometry, San Diego, CA, USA, 5/19/93.
Halperin D, Yap C. Combinatorial complexity of translating a box in polyhedral 3-space. In Anon, editor, Proceedings of the 9th Annual Symposium on Computational Geometry. Publ by ACM. 1993. p. 29-37
Halperin, Dan ; Yap, Chee. / Combinatorial complexity of translating a box in polyhedral 3-space. Proceedings of the 9th Annual Symposium on Computational Geometry. editor / Anon. Publ by ACM, 1993. pp. 29-37
@inproceedings{b43647733a65487295c82dd59bf24f3d,
title = "Combinatorial complexity of translating a box in polyhedral 3-space",
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(n 2α(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(n 3).",
author = "Dan Halperin and Chee Yap",
year = "1993",
language = "English (US)",
isbn = "0897915828",
pages = "29--37",
editor = "Anon",
booktitle = "Proceedings of the 9th Annual Symposium on Computational Geometry",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Combinatorial complexity of translating a box in polyhedral 3-space

AU - Halperin, Dan

AU - Yap, Chee

PY - 1993

Y1 - 1993

N2 - 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(n 2α(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(n 3).

AB - 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(n 2α(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(n 3).

UR - http://www.scopus.com/inward/record.url?scp=0027803463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027803463&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0897915828

SP - 29

EP - 37

BT - Proceedings of the 9th Annual Symposium on Computational Geometry

A2 - Anon, null

PB - Publ by ACM

ER -