An Efficient Adaptive Algorithm for Constructing the Convex Differences Tree of a Simple Polygon

  title={An Efficient Adaptive Algorithm for Constructing the Convex Differences Tree of a Simple Polygon},
  author={A. Rappoport},
  journal={Computer Graphics Forum},
  • A. Rappoport
  • Published 1 August 1992
  • Mathematics, Computer Science
  • Computer Graphics Forum
The convex differences tree (CDT) representation of a simple polygon is useful in computer graphics, computer vision, computer aided design and robotics. The root of the tree contains the convex hull of the polygon and there is a child node recursively representing every connectivity component of the set difference between the convex hull and the polygon. We give an O(n log K + K log2 n) time algorithm for constructing the CDT, where n is the number of polygon vertices and K is the number of… 
A Convex Deficiency Tree Algorithm for Curved Polygons
  • V. Shapiro
  • Mathematics, Computer Science
    Int. J. Comput. Geom. Appl.
  • 2001
The convex deficiency tree (CDT) algorithm described in this paper constructslean set representations of curved two-dimensional polygons automatically for polygons bounded by linear and curved edges that are subsets of convex curves.
Interactive Boolean operations for conceptual design of 3-D solids
This paper presents a method for interactive display of CSG models using standard, widely available graphics hardware, and enables the user to interactively modify the affine transformations associated with CSG sub-objects.
Reconstruction of Plausible 3D Tree Models from Instrumented Photographs
This paper presents an approach for employing a particu lar procedural modeling technique, L-systems, to produce a tree resembling one occurrin g in a set of input photographs, resulting in efficient realistic reconstruction.
Reconstruction of 3 D Tree Models from Instrumented Photographs
To landscape creators, the ability to model trees is of utmost importance since the realism of the resulting architectural model is greatly enhanced by their presence. Although currently many
Toward N-dimensional parallel optical image processing
Encodings of N-dimensional images on planar screens are studied from the standpoint of their suitability for reduction of N-dimensional image processing to 2-dimensional one. Such a reduction, if
How to implement N-dimensional pattern recognition optically
A recursive formula expressing N-dimensional convolutions/correlations via (N - 1)-dimensional ones is proposed. It can serve as a basis for implementing N-dimensional pattern recognition optically.


An efficient algorithm for finding the CSG representation of a simple polygon
A new proof that the interior of each simple polygon can be represented by a monotone boolean formula based on the half-planes supporting the sides of the polygon and using each such half-plane only once.
Hierarchical Shape Description Based upon Convex Hulls of Concavities
The generation of standardized trees is discussed so that tree/shape matching may be accomplished with a minimum of computational effort.
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
A general purpose programming technique, called the Simulation of Simplicity, which can be used to cope with degenerate input data for geometric algorithms, and it is believed that this technique will become a standard tool in writing geometric software.
Measuring Concavity on a Rectangular Mosaic
  • J. Sklansky
  • Mathematics, Computer Science
    IEEE Transactions on Computers
  • 1972
A theory for describing and measuring the concavities of cellular complexes (digitized silhouettes) is developed. This theory involves the use of the minimum-perimeter polygon and its convex hull.
hull of a simple polyline ”
  • Information Processing Letters
  • 1985
Hierarchical shape description polygon clipping
  • The Visual Computer: an International