Geometric data structures for computer graphics

The goal of this tutorial is to present a wide range of geometric data structures, algorithms and techniques from computational geometry to computer graphics practitioners. To achieve this goal we introduce several data structures, discuss their complexity, point out construction schemes and the corresponding performance and present standard applications in two and three dimensions.

[1]  Alfred M. Bruckstein,et al.  Multivalued distance maps for motion planning on surfaces with moving obstacles , 1998, IEEE Trans. Robotics Autom..

[2]  Reinhard Klein,et al.  A geometric approach to 3D object comparison , 2001, Proceedings International Conference on Shape Modeling and Applications.

[3]  Dieter W. Fellner,et al.  Automatic Creation of Object Hierarchies for Radiosity Clustering , 1999, Comput. Graph. Forum.

[4]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[5]  Richard L. Grimsdale,et al.  Collision Detection for Animation using Sphere‐Trees , 1995, Comput. Graph. Forum.

[6]  John Amanatides,et al.  Merging BSP trees yields polyhedral set operations , 1990, SIGGRAPH.

[7]  Gabriel Zachmann,et al.  Rapid collision detection by dynamically aligned DOP-trees , 1998, Proceedings. IEEE 1998 Virtual Reality Annual International Symposium (Cat. No.98CB36180).

[8]  Mark H. Overmars,et al.  The Design of Dynamic Data Structures , 1987, Lecture Notes in Computer Science.

[9]  Brian Wyvill,et al.  Different applications of two-dimensional potential fields for volume modeling , 2002 .

[10]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[11]  Marc Levoy,et al.  Fast texture synthesis using tree-structured vector quantization , 2000, SIGGRAPH.

[12]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[13]  Norman Chin.  Partitioning a 3-d Convex Polygon with an Arbitrary plane , 1992, Graphics Gems III.

[14]  Gabriel Zachmann.  REAL-TIME AND EXACT COLLISION DETECTION FOR INTERACTIVE VIRTUAL PROTOTYPING , 1997 .

[15]  F. Frances Yao,et al.  Efficient binary space partitions for hidden-surface removal and solid modeling , 1990, Discret. Comput. Geom..

[16]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[17]  Bernard Chazelle,et al.  Self-customized BSP trees for collision detection , 2000, Comput. Geom..

[18]  Timos K. Sellis,et al.  Review - The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles , 2000, ACM SIGMOD Digital Review.

[19]  D. T. Lee,et al.  Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..

[20]  Sigal Ar,et al.  Deferred, Self‐Organizing BSP Trees , 2002, Comput. Graph. Forum.

[21]  Lenhart K. Schubert,et al.  An optimal algorithm for constructing the Delaunay triangulation of a set of line segments , 1987, SCG '87.

[22]  Gino van den Bergen,et al.  Collision Detection , 2003, Real-Time Rendering.

[23]  Ming C. Lin,et al.  Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition , 2001, Comput. Graph. Forum.

[24]  Tomas Akenine-Möller,et al.  Collision Detection for Continuously Deforming Bodies , 2001, Eurographics.

[25]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[26]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[27]  Ming Wan,et al.  Distance-field based skeletons for virtual navigation , 2001, Proceedings Visualization, 2001. VIS '01..

[28]  Arthur W. Toga,et al.  Distance field manipulation of surface models , 1992, IEEE Computer Graphics and Applications.

[29]  Martin Vetterli,et al.  Computational analysis of 4-8 meshes with application to surface simplification using global error , 2001, CCCG.

[30]  Franz Aurenhammer,et al.  Handbook of Computational Geometry , 2000 .

[31]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[32]  Bernd Hamann,et al.  Virtual Clay Modeling using Adaptive Distance Fields , 2001 .

[33]  Rex A. Dwyer.  Higher-dimensional voronoi diagrams in linear expected time , 1989, SCG '89.

[34]  Gabriel Zachmann,et al.  Minimal hierarchical collision detection , 2002, VRST '02.

[35]  Jelena Kovacevic,et al.  Quadtrees for embedded surface visualization: constraints and efficient data structures , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[36]  David W. Paglieroni,et al.  Distance transforms: Properties and machine vision applications , 1992, CVGIP Graph. Model. Image Process..

[37]  B. Naylor.  A Tutorial on Binary Space Partitioning Trees , 2001 .

[38]  Jean-Daniel Boissonnat,et al.  On the Randomized Construction of the Delaunay Tree , 1993, Theor. Comput. Sci..

[39]  James Arvo,et al.  A survey of ray tracing acceleration techniques , 1989 .

[40]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[41]  Frank Dehne,et al.  A computational geometry approach to clustering problems , 1985, SCG '85.

[42]  Horst W. Hamacher.  Mathematische Lösungsverfahren für planare Standortprobleme , 1995 .

[43]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[44]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[45]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[46]  J. Sethian.  AN ANALYSIS OF FLAME PROPAGATION , 1982 .

[47]  Donald P. Greenberg,et al.  Improved Computational Methods for Ray Tracing , 1984, TOGS.

[48]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[49]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[50]  Reinhard Klein,et al.  Reconstruction and simplification of surfaces from contours , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[51]  Tohru Ogawa,et al.  A new algorithm for three-dimensional voronoi tessellation , 1983 .

[52]  Bernard Chazelle,et al.  Matching 3D models with shape distributions , 2001, Proceedings International Conference on Shape Modeling and Applications.

[53]  Carlos Ureña,et al.  An Efficient Parametric Algorithm for Octree Traversal , 2000, WSCG.

[54]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[55]  Nick Roussopoulos,et al.  Direct spatial search on pictorial databases using packed R-trees , 1985, SIGMOD Conference.

[56]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[57]  Shin'ichi Satoh,et al.  The SR-tree: an index structure for high-dimensional nearest neighbor queries , 1997, SIGMOD '97.

[58]  Leonidas J. Guibas,et al.  BOXTREE: A Hierarchical Representation for Surfaces in 3D , 1996, Comput. Graph. Forum.

[59]  Mark de Berg.  Linear Size Binary Space Partitions for Fat Objects , 1995, ESA.

[60]  David P. Dobkin,et al.  Primitives for the manipulation of three-dimensional subdivisions , 1987, SCG '87.

[61]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[62]  B. Joe.  Three-dimensional triangulations from local transformations , 1989 .

[63]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[64]  Valerio Pascucci,et al.  Visualization of large terrains made easy , 2001, Proceedings Visualization, 2001. VIS '01..

[65]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[66]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[67]  Daniel Cohen-Or,et al.  Three-dimensional distance field metamorphosis , 1998, TOGS.

[68]  Jane Wilhelms,et al.  Octrees for faster isosurface generation , 1990, SIGGRAPH 1990.

[69]  Mark de Berg.  Linear Size Binary Space Partitions for Uncluttered Scenes , 2000, Algorithmica.

[70]  Marie-Paule Cani,et al.  Eurographics , 1999 .

[71]  Cao An Wang,et al.  Efficiently updating constrained Delaunay triangulations , 1993, BIT.

[72]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[73]  Jian Huang,et al.  A complete distance field representation , 2001, Proceedings Visualization, 2001. VIS '01..

[74]  Roman Kuchkuda,et al.  An introduction to ray tracing , 1993, Comput. Graph..

[75]  Reinhard Klein,et al.  Reconstruction and Simplification of Surfaces from Contours , 2000, Graph. Model..

[76]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[77]  Tsai-Yen Li,et al.  Incremental 3D collision detection with hierarchical data structures , 1998, VRST '98.

[78]  V. T. Rajan,et al.  Optimality of the Delaunay triangulation in Rd , 1991, SCG '91.

[79]  Rolf Klein,et al.  Algorithmische Geometrie , 1997 .

[80]  Mario A. López,et al.  STR: a simple and efficient algorithm for R-tree packing , 1997, Proceedings 13th International Conference on Data Engineering.

[81]  Franz Aurenhammer,et al.  Voronoi Diagrams , 2000, Handbook of Computational Geometry.

[82]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[83]  Enric Torres,et al.  Optimization of the Binary Space Partition Algorithm (BSP) for the Visualization of Dynamic Scenes , 1990, Eurographics.

[84]  Mark W. Jones,et al.  Shape representation using space filled sub-voxel distance fields , 2001, Proceedings International Conference on Shape Modeling and Applications.

[85]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[86]  Andrzej Lingas,et al.  On Computing the Voronoi Diagram for Restricted Planar Figures , 1991, WADS.

[87]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[88]  D. A. Field,et al.  Implementing Watson's algorithm in three dimensions , 1986, SCG '86.

[89]  Kalpathi R. Subramanian,et al.  Fast Ray Tracing Using K-d Trees , 1988 .

[90]  James Arvo,et al.  Fast ray tracing by ray classification , 1987, SIGGRAPH '87.

[91]  William Ribarsky,et al.  Real-time, continuous level of detail rendering of height fields , 1996, SIGGRAPH.