A CONVEX DEFICIENCY TREE ALGORITHM FOR CURVED POLYGONS

DOI10.1142/S0218195901000468zbMath1074.68650OpenAlexW2102898148MaRDI QIDQ4682176

Vadim Shapiro

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000468

zbMATH Keywords

polygon decompositionrepresentation conversionBoolean representationconvex deficiencyCSG (constructive solid geometry)Curved polygons

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Convex hulls of objects bounded by algebraic curves
• Construction and optimization of CSG representations
• Convex hulls of piecewise-smooth Jordan curves
• WELL-FORMED SET REPRESENTATIONS OF SOLIDS
• Separation for boundary to CSG conversion

This page was built for publication: A CONVEX DEFICIENCY TREE ALGORITHM FOR CURVED POLYGONS