A CONVEX DEFICIENCY TREE ALGORITHM FOR CURVED POLYGONS

DOI10.1142/S0218195901000468MaRDI QIDQ4682176zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• THE EXTENDED CONVEX DIFFERENCES TREE (ECDT) REPRESENTATION FOR N-DIMENSIONAL POLYHEDRA
• Convex hulls of piecewise-smooth Jordan curves
• An efficient algorithm for finding the CSG representation of a simple polygon
• Detecting the intersection of convex objects in the plane
• scientific article; zbMATH DE number 1947391

Cites work

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

Cited in

(3)

• A procedure for computing the symmetric difference of regions defined by polygonal curves
• scientific article; zbMATH DE number 857627 (Why is no real title available?)
• scientific article; zbMATH DE number 176572 (Why is no real title available?)

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

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