Convexifying Star-Shaped Polygons - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Convexifying Star-Shaped Polygons


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.
Fichier principal
Vignette du fichier
Convexifying_star_shaped_polygons_CCCG98.pdf (94.77 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00442788 , version 1 (23-12-2009)


  • 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⟩
280 View
240 Download


Gmail Facebook Twitter LinkedIn More