Convexifying Star-Shaped Polygons

Abstract : We show that all star-shaped simple polygons can be transformed, in O(n) steps each of which takes O(n) time to compute in an extended real RAM model, into convex polygons by continuous motions during which the edges remain rigid and the polygon remains star-shaped and simple. For each step, the trajectories of the vertices are given explicitly. In particular, the vertices move along straight lines, circular-arcs, or on the curve traced by an intersection point of two circles whose centers move along straight lines.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [1 references]  Display  Hide  Download

https://hal.inria.fr/inria-00442788
Contributor : Sylvain Lazard <>
Submitted on : Wednesday, December 23, 2009 - 9:50:02 AM
Last modification on : Thursday, February 7, 2019 - 4:50:27 PM
Document(s) archivé(s) le : Friday, June 18, 2010 - 12:04:13 AM

Files

Convexifying_star_shaped_polyg...
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00442788, version 1

Collections

Citation

Hazel Everett, Sylvain Lazard, Steve Robbins, H. Schröder, Sue Whitesides. Convexifying Star-Shaped Polygons. 10th Canadian Conference on Computational Geometry (CCCG'98), 1998, Montreal, Canada. pp.10-12. ⟨inria-00442788⟩

Share

Metrics

Record views

448

Files downloads

188