Localized set operations for solid modeling

Set operation algorithms form an important component of solid modeling systems. Their efficiency can be enhanced by localizing the search for geometric intersections to the region of overlap using a spatial directory. We present an algorithm that employs a three-dimensional extendible cell (EXCELL) directory to the set operation problem, and demonstrate by practical experiments the efficiency and the local nature of the algorithm.

[1]  Charles M. Eastman,et al.  Geometric Modeling Using the Euler Operators , 1979 .

[2]  John Woodwark,et al.  A spatially-segmented solids database — justification and design , 1982 .

[3]  Gershon Kedem,et al.  The quad-cif tree a data structure for h , 1981, DAC 1982.

[4]  Ronald Fagin,et al.  Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..

[5]  Gershon Kedem.  The Quad-CIF Tree: A Data Structure for Hierarchical On-Line Algorithms , 1982, 19th Design Automation Conference.

[6]  Bruce G. Baumgart,et al.  Geometric modeling for computer vision. , 1974 .

[7]  Derick Wood,et al.  Counting and Reporting Intersections of d-Ranges , 1982, IEEE Transactions on Computers.

[8]  Jon Louis Bentley,et al.  A survey of algorithms and data structures for range searching , 1978 .

[9]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[10]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[11]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[12]  Aristides A. G. Requicha,et al.  Geometric Modeling of Mechanical Parts and Processes , 1977, Computer.

[13]  Markku Tamminen,et al.  Extendible Hashing with Overflow , 1982, Inf. Process. Lett..

[14]  J. G. Griffiths.  Eliminating hidden edges in line drawings , 1979 .

[15]  Mantyla,et al.  GWB: A Solid Modeler with Euler Operators , 1982, IEEE Computer Graphics and Applications.

[16]  David B. Lomet,et al.  Digital B-Trees , 1981, VLDB.

[17]  W. Randolph Franklin.  A linear time exact hidden surface algorithm , 1980, SIGGRAPH '80.

[18]  Reijo Sulonen,et al.  The EXCELL Method for Efficient Geometric Access to Data , 1982, 19th Design Automation Conference.

[19]  Scott D. Roth,et al.  Ray casting for modeling solids , 1982, Comput. Graph. Image Process..

[20]  Requicha,et al.  Solid Modeling: A Historical Summary and Contemporary Assessment , 1982, IEEE Computer Graphics and Applications.

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

[22]  Derick Wood,et al.  An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.

[23]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.