Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams

Daniel Leven; Micha Sharir

doi:10.1007/BF02187867

Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams

Daniel Leven^*, Micha Sharir

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

110 Scopus citations

Abstract

An O(n log n) algorithm for planning a purely translational motion for a simple convex object amidst polygonal barriers in two-dimensional space is given. The algorithm is based on a new generalization of Voronoi diagrams (similar to that proposed by Chew and Drysdale [1] and by Fortune [2]), and adapts and uses a recent technique of Yap for the efficient construction of these diagrams.

Original language	English
Pages (from-to)	9-31
Number of pages	23
Journal	Discrete and Computational Geometry
Volume	2
Issue number	1
DOIs	https://doi.org/10.1007/BF02187867
State	Published - Dec 1987

Access to Document

10.1007/BF02187867

Cite this

@article{7ed02fcd40794b9d8110cc2116e28fab,

title = "Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams",

abstract = "An O(n log n) algorithm for planning a purely translational motion for a simple convex object amidst polygonal barriers in two-dimensional space is given. The algorithm is based on a new generalization of Voronoi diagrams (similar to that proposed by Chew and Drysdale [1] and by Fortune [2]), and adapts and uses a recent technique of Yap for the efficient construction of these diagrams.",

author = "Daniel Leven and Micha Sharir",

year = "1987",

month = dec,

doi = "10.1007/BF02187867",

language = "אנגלית",

volume = "2",

pages = "9--31",

journal = "Discrete and Computational Geometry",

issn = "0179-5376",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams

AU - Leven, Daniel

AU - Sharir, Micha

PY - 1987/12

Y1 - 1987/12

N2 - An O(n log n) algorithm for planning a purely translational motion for a simple convex object amidst polygonal barriers in two-dimensional space is given. The algorithm is based on a new generalization of Voronoi diagrams (similar to that proposed by Chew and Drysdale [1] and by Fortune [2]), and adapts and uses a recent technique of Yap for the efficient construction of these diagrams.

AB - An O(n log n) algorithm for planning a purely translational motion for a simple convex object amidst polygonal barriers in two-dimensional space is given. The algorithm is based on a new generalization of Voronoi diagrams (similar to that proposed by Chew and Drysdale [1] and by Fortune [2]), and adapts and uses a recent technique of Yap for the efficient construction of these diagrams.

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

U2 - 10.1007/BF02187867

DO - 10.1007/BF02187867

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0002275443

SN - 0179-5376

VL - 2

SP - 9

EP - 31

JO - Discrete and Computational Geometry

JF - Discrete and Computational Geometry

IS - 1

ER -

Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams

Abstract

Access to Document

Other files and links

Fingerprint

Cite this