Primitive Trees for Precomputed Distance Queries

We propose the primitive tree, a novel and compact space‐partition method that samples and reconstructs a distance field with high accuracy, even for regions far from the surfaces. The primitive tree is based on the octree and stores the indices of the nearest primitives in its leaf nodes. Most previous approaches have involved a trade‐off between accuracy and speed in distance queries, but our method can improve both aspects simultaneously. In addition, our method can sample unsigned distance fields effectively, even for self‐intersecting and nonmanifold models. We present test results showing that our method can sample and represent large scenes, with more than ten million triangles, rapidly and accurately.

[1]  D. Meiron,et al.  Efficient algorithms for solving static hamilton-jacobi equations , 2003 .

[2]  Enhua Wu,et al.  Fast Computing Adaptively Sampled Distance Field on GPU , 2011, PG.

[3]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[4]  Klaus Mueller,et al.  Feature preserving distance fields , 2004 .

[5]  Insung Ihm,et al.  Computing Local Signed Distance Fields for Large Polygonal Models , 2008, Comput. Graph. Forum.

[6]  Dinesh Manocha,et al.  Interactive 3D distance field computation using linear factorization , 2006, I3D '06.

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

[8]  Ken Museth,et al.  Dynamic Tubular Grid: An Efficient Data Structure and Algorithms for High Resolution Level Sets , 2006, J. Sci. Comput..

[9]  John C. Hart,et al.  Sphere tracing: a geometric method for the antialiased ray tracing of implicit surfaces , 1996, The Visual Computer.

[10]  Philipp Slusallek,et al.  Balancing Considered Harmful - Faster Photon Mapping using the Voxel Volume Heuristic , 2004, Comput. Graph. Forum.

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

[12]  Dinesh Manocha,et al.  DiFi: Fast 3D Distance Field Computation Using Graphics Hardware , 2004, Comput. Graph. Forum.

[13]  Dinesh Manocha,et al.  GPU-based offset surface computation using point samples , 2013, Comput. Aided Des..

[14]  Kun Zhou,et al.  Real-time KD-tree construction on graphics hardware , 2008, SIGGRAPH Asia '08.

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

[16]  Leif Kobbelt,et al.  Piecewise Linear Approximation of Signed Distance Fields , 2003, VMV.

[17]  Roger Crawfis,et al.  Adaptively Represented Complete Distance Fields , 2002 .

[18]  H. D. Luke,et al.  The origins of the sampling theorem , 1999 .

[19]  I. Wald,et al.  On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[20]  Hans-Dieter Lüke,et al.  The origins of the sampling theorem , 1999, IEEE Commun. Mag..

[21]  Jehee Lee,et al.  Linkless Octree Using Multi‐Level Perfect Hashing , 2009, Comput. Graph. Forum.

[22]  Ken Museth,et al.  Hierarchical RLE level set: A compact and versatile deformable surface representation , 2006, TOGS.

[23]  Klaus Mueller,et al.  Feature preserving distance fields , 2004, 2004 IEEE Symposium on Volume Visualization and Graphics.

[24]  Mark W. Jones,et al.  Vector-City Vector Distance Transform , 2001, Comput. Vis. Image Underst..

[25]  Sylvain Lefebvre,et al.  Compressed Random-Access Trees for Spatially Coherent Data , 2007, Rendering Techniques.

[26]  Jakob Andreas Bærentzen,et al.  3D distance fields: a survey of techniques and applications , 2006, IEEE Transactions on Visualization and Computer Graphics.