Approximate envelope reconstruction for moving solids

We present a new approach to approximately construct the envelope of a moving solid. It is based on dynamically updating an octree that approximates the envelope surface. Our approach guarantees a prescribed error-bound, and is scalable in the sense that it allows a very fast calculation of coarse approximations, while better approximations can be obtained by investing more computation time and memory. Furthermore, the algorithm is robust due to the fact that no badly conditioned surface-surface intersections have to be computed.

[1]  H. Whitney Elementary Structure of Real Algebraic Varieties , 1957 .

[2]  Manfredo P. do Carmo,et al.  Differential geometry of curves and surfaces , 1976 .

[3]  Willem F. Bronsvoort,et al.  Ray tracing generalized cylinders , 1985, TOGS.

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

[5]  James H. Davenport,et al.  Computer Algebra: Systems and Algorithms for Algebraic Computation , 1988 .

[6]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[7]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[8]  James Arvo A simple method for box-sphere intersection testing , 1990 .

[9]  Pere Brunet,et al.  Solid representation and operation using extended octrees , 1990, TOGS.

[10]  Vadim Shapiro,et al.  Real functions for representation of rigid solids , 1994, Comput. Aided Geom. Des..

[11]  Gabriel Taubin,et al.  Estimating the tensor of curvature of a surface from a polyhedral approximation , 1995, Proceedings of IEEE International Conference on Computer Vision.

[12]  Zeng-Jia Hu,et al.  Swept volumes generated by the natural quadric surfaces , 1996, Comput. Graph..

[13]  Josep Fontdecaba,et al.  Dimensional verification of NC machining profiles using extended quadtrees , 1996, Comput. Aided Des..

[14]  Sabine Coquillart,et al.  3D Reconstruction of Complex Polyhedral Shapes from Contours using a Simplified Generalized Voronoi Diagram , 1996, Comput. Graph. Forum.

[15]  Brian Wyvill,et al.  Introduction to Implicit Surfaces , 1997 .

[16]  Ming C. Leu,et al.  Trimming swept volumes , 1999, Comput. Aided Des..

[17]  Jianguang Sun,et al.  The sweep-envelope differential equation algorithm for general deformed swept volumes , 2000, Comput. Aided Geom. Des..

[18]  Dereck S. Meek,et al.  On surface normal and Gaussian curvature approximations given data sampled from a smooth surface , 2000, Comput. Aided Geom. Des..

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

[20]  A. Guezlec,et al.  "Meshsweeper": dynamic point-to-polygonal mesh distance and applications , 2001 .