Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

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
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Sylvain Lazard Connect in order to contact the contributor
Submitted on : Wednesday, December 23, 2009 - 9:50:02 AM
Last modification on : Thursday, January 20, 2022 - 4:16:34 PM
Long-term archiving on: : Friday, June 18, 2010 - 12:04:13 AM


Files produced by the author(s)


  • HAL Id : inria-00442788, version 1



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⟩



Record views


Files downloads