DETERMINING 2 MINIMAL CIRCUMSCRIBING DISKS FOR A POLYGON

Citation
Ys. Xu et al., DETERMINING 2 MINIMAL CIRCUMSCRIBING DISKS FOR A POLYGON, Computer Aided Design, 27(3), 1995, pp. 223-234
Citations number
12
Categorie Soggetti
Computer Sciences, Special Topics","Computer Science Software Graphycs Programming
Journal title
ISSN journal
00104485
Volume
27
Issue
3
Year of publication
1995
Pages
223 - 234
Database
ISI
SICI code
0010-4485(1995)27:3<223:D2MCDF>2.0.ZU;2-R
Abstract
The paper proposes a 2-disc motion planning strategy to navigate an ob ject within free space between obstacles from an initial location to a final location. The method makes use of the medial axis transform of the free space. Two minimal overlapping discs that fully enclose the m oving object are determined, and then the centres of the two discs are constrained to move continuously along a path on the medial axis. The paper focuses on the problem of finding the two enclosing discs for a n arbitrary moving polygon object. The problem is reduced to one of fi nding an optimal straight line cut through the polygon such that each of the subpolygons can be covered by a minimal disc. The paper discuss es how an arbitrary polygon is cut, and how the two minimal overlappin g discs that cover the given polygon are determined. Simulations are p resented for a variety of polygons. The method has been used for plann ing part disassembly motion from inside to outside assembly.