A Convex Deficiency Tree Algorithm for Curved Polygons

Boolean set representations of curved two-dimensional polygons are expressions constructed from planar halfspaces and (possibly regularized) set operations. Such representations arise often in geometric modeling, computer vision, robotics, and computational mechanics. The convex deficiency tree (CDT) algorithm described in this paper constructs such expressions automatically for polygons bounded by linear and curved edges that are subsets of convex curves. The running time of the algorithm is not worse than O(n2log n) and the size of the constructed expressions is linear in the number of polygon edges. The algorithm has been fully implemented for polygons bounded by linear and circular edges.

[1]  V. Shapiro,et al.  Efficient CSG Representations of Two-Dimensional Solids , 1991 .

[2]  B. G. Batchelor,et al.  Hierarchical Shape Description Based upon Convex Hulls of Concavities , 1980, Cybern. Syst..

[3]  Vadim Shapiro,et al.  Construction and optimization of CSG representations , 1991, Comput. Aided Des..

[4]  Leonidas J. Guibas,et al.  An efficient algorithm for finding the CSG representation of a simple polygon , 1988, Algorithmica.

[5]  Robert B. Tilove,et al.  Set Membership Classification: A Unified Approach to Geometric Intersection Problems , 1980, IEEE Transactions on Computers.

[6]  Donald L. Vossler.  Sweep-to-CSG Conversion Using Pattern Recognition Techniques , 1985, IEEE Computer Graphics and Applications.

[7]  D. Wilde,et al.  A Convergent Convex Decomposition of Polyhedral Objects , 1992 .

[8]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[9]  Vadim Shapiro,et al.  Separation for boundary to CSG conversion , 1993, TOGS.

[10]  Ari Rappoport.  An Efficient Adaptive Algorithm for Constructing the Convex Differences Tree of a Simple Polygon , 1992, Comput. Graph. Forum.

[11]  Alejandro A. Schäffer,et al.  Convex Hulls of Piecewise-Smooth Jordan Curves , 1987, J. Algorithms.

[12]  Alan E. Middleditch,et al.  Convex Decomposition of Simple Polygons , 1984, TOGS.

[13]  John Hershberger,et al.  Cartographic Line Simplification and Polygon CSG Formulae and in O(n log* n) Time , 1997, WADS.

[14]  Vadim Shapiro,et al.  Well-Formed Set Representations of Solids , 1999, Int. J. Comput. Geom. Appl..

[15]  John Woodwark,et al.  GRAPHICAL INPUT TO A BOOLEAN SOLID MODELLER , 1982 .

[16]  D. P. Peterson.  Boundary to constructive solid geometry mappings: a focus on 2D issues , 1986 .