Generalized voronoi diagrams for moving a ladder. I: Topological analysis

Colm Ó'Dunlaing, Micha Sharir, Chee K. Yap

Research output: Contribution to journalArticle

Abstract

Given a bounded open subset Ω of the plane whose boundary is the union of finitely many polygons, and a real number d > 0, a manifold FP (the [free placements]) may be defined as the set of placements of a closed oriented line‐segment B (a [ladder]) of length d inside Ω. FP is a three‐dimensional manifold. A [Voronoi complex] in this manifold, a two‐dimensional cell complex, is defined by analogy with the classical geometric construction in the plane; within this complex a one‐dimensional subcomplex N, called the skeleton, is defined. It is shown that every component of FP contains a unique component of N, and canonical motions are given to move the ladder to placements within N. In this way, general motion planning is reduced to searching in a suitable representation of N as a (combinatorial) graph. Efficient construction of N is described in a companion paper.

Original languageEnglish (US)
Pages (from-to)423-483
Number of pages61
JournalCommunications on Pure and Applied Mathematics
Volume39
Issue number4
DOIs
StatePublished - 1986

Fingerprint

Voronoi Diagram
Ladders
Placement
Motion planning
Cell Complex
Motion Planning
Voronoi
Skeleton
Polygon
Analogy
Union
Closed
Three-dimensional
Subset
Motion
Graph in graph theory

ASJC Scopus subject areas

  • Mathematics(all)
  • Applied Mathematics

Cite this

Generalized voronoi diagrams for moving a ladder. I : Topological analysis. / Ó'Dunlaing, Colm; Sharir, Micha; Yap, Chee K.

In: Communications on Pure and Applied Mathematics, Vol. 39, No. 4, 1986, p. 423-483.

Research output: Contribution to journalArticle

@article{db7b8d0bf4014b23b826424b8c21b0e0,
title = "Generalized voronoi diagrams for moving a ladder. I: Topological analysis",
abstract = "Given a bounded open subset Ω of the plane whose boundary is the union of finitely many polygons, and a real number d > 0, a manifold FP (the [free placements]) may be defined as the set of placements of a closed oriented line‐segment B (a [ladder]) of length d inside Ω. FP is a three‐dimensional manifold. A [Voronoi complex] in this manifold, a two‐dimensional cell complex, is defined by analogy with the classical geometric construction in the plane; within this complex a one‐dimensional subcomplex N, called the skeleton, is defined. It is shown that every component of FP contains a unique component of N, and canonical motions are given to move the ladder to placements within N. In this way, general motion planning is reduced to searching in a suitable representation of N as a (combinatorial) graph. Efficient construction of N is described in a companion paper.",
author = "Colm {\'O}'Dunlaing and Micha Sharir and Yap, {Chee K.}",
year = "1986",
doi = "10.1002/cpa.3160390402",
language = "English (US)",
volume = "39",
pages = "423--483",
journal = "Communications on Pure and Applied Mathematics",
issn = "0010-3640",
publisher = "Wiley-Liss Inc.",
number = "4",

}

TY - JOUR

T1 - Generalized voronoi diagrams for moving a ladder. I

T2 - Topological analysis

AU - Ó'Dunlaing, Colm

AU - Sharir, Micha

AU - Yap, Chee K.

PY - 1986

Y1 - 1986

N2 - Given a bounded open subset Ω of the plane whose boundary is the union of finitely many polygons, and a real number d > 0, a manifold FP (the [free placements]) may be defined as the set of placements of a closed oriented line‐segment B (a [ladder]) of length d inside Ω. FP is a three‐dimensional manifold. A [Voronoi complex] in this manifold, a two‐dimensional cell complex, is defined by analogy with the classical geometric construction in the plane; within this complex a one‐dimensional subcomplex N, called the skeleton, is defined. It is shown that every component of FP contains a unique component of N, and canonical motions are given to move the ladder to placements within N. In this way, general motion planning is reduced to searching in a suitable representation of N as a (combinatorial) graph. Efficient construction of N is described in a companion paper.

AB - Given a bounded open subset Ω of the plane whose boundary is the union of finitely many polygons, and a real number d > 0, a manifold FP (the [free placements]) may be defined as the set of placements of a closed oriented line‐segment B (a [ladder]) of length d inside Ω. FP is a three‐dimensional manifold. A [Voronoi complex] in this manifold, a two‐dimensional cell complex, is defined by analogy with the classical geometric construction in the plane; within this complex a one‐dimensional subcomplex N, called the skeleton, is defined. It is shown that every component of FP contains a unique component of N, and canonical motions are given to move the ladder to placements within N. In this way, general motion planning is reduced to searching in a suitable representation of N as a (combinatorial) graph. Efficient construction of N is described in a companion paper.

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

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

U2 - 10.1002/cpa.3160390402

DO - 10.1002/cpa.3160390402

M3 - Article

AN - SCOPUS:84990619101

VL - 39

SP - 423

EP - 483

JO - Communications on Pure and Applied Mathematics

JF - Communications on Pure and Applied Mathematics

SN - 0010-3640

IS - 4

ER -