Combinatorial complexity of translating a box in polyhedral 3-space

Dan Halperin, Chee Yap

Research output: Contribution to journalArticle

Abstract

We study the space of free translations of a box amidst polyhedral obstacles with n vertices. 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). For the case of a convex polygon of fixed (constant) size translating in the same setting (namely, a two-dimensional polygon translating in three-dimensional space), we show a tight bound Θ(n 2α(n)) on the complexity of the free space.

Original languageEnglish (US)
Pages (from-to)181-196
Number of pages16
JournalComputational Geometry: Theory and Applications
Volume9
Issue number3
StatePublished - Feb 1998

Fingerprint

Combinatorial Complexity
Inverse function
Convex polygon
Free Space
Polygon
Lower bound
Three-dimensional

Keywords

  • Computational geometry
  • Minkowski sums
  • Motion planning

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology

Cite this

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

In: Computational Geometry: Theory and Applications, Vol. 9, No. 3, 02.1998, p. 181-196.

Research output: Contribution to journalArticle

@article{96b87062aceb44599a0d5e0be95915b7,
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 vertices. 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). For the case of a convex polygon of fixed (constant) size translating in the same setting (namely, a two-dimensional polygon translating in three-dimensional space), we show a tight bound Θ(n 2α(n)) on the complexity of the free space.",
keywords = "Computational geometry, Minkowski sums, Motion planning",
author = "Dan Halperin and Chee Yap",
year = "1998",
month = "2",
language = "English (US)",
volume = "9",
pages = "181--196",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

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

AU - Halperin, Dan

AU - Yap, Chee

PY - 1998/2

Y1 - 1998/2

N2 - We study the space of free translations of a box amidst polyhedral obstacles with n vertices. 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). For the case of a convex polygon of fixed (constant) size translating in the same setting (namely, a two-dimensional polygon translating in three-dimensional space), we show a tight bound Θ(n 2α(n)) on the complexity of the free space.

AB - We study the space of free translations of a box amidst polyhedral obstacles with n vertices. 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). For the case of a convex polygon of fixed (constant) size translating in the same setting (namely, a two-dimensional polygon translating in three-dimensional space), we show a tight bound Θ(n 2α(n)) on the complexity of the free space.

KW - Computational geometry

KW - Minkowski sums

KW - Motion planning

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

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

M3 - Article

VL - 9

SP - 181

EP - 196

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 3

ER -