Convexifying monotone polygons

DOI10.1007/3-540-46632-0_42MaRDI QIDQ4511242zbMATH OpenFDO

Authors Erik D. Demaine, Sylvain Lazard, S. Robbins, Michael Soss, Therese Biedl

Publication date 30 October 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46632-0_42

zbMATH Keywords

monotone polygon

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Reconfiguring convex polygons
• Mathematical Foundations of Computer Science 2004
• Convexifying monotone polygons while maintaining internal visibility
• scientific article; zbMATH DE number 1877248
• Visibility-preserving convexifications using single-vertex moves

Cited in

(10)

• Rotationally monotone polygons
• On the monotonization of polyhedra
• Convexifying polygons with simple projections
• Computing signed permutations of polygons
• GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
• Reconfiguration of polygons
• Visibility-preserving convexifications using single-vertex moves
• Convexifying monotone polygons while maintaining internal visibility
• Mathematical Foundations of Computer Science 2004
• Reconfiguring convex polygons

This page was built for publication: Convexifying monotone polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4511242)