DiFi: Fast 3D distance field computation using graphics hardware

Computer Graphics Forum

Volumn 23, Issue 3 SPEC. ISS., 2004, Pages 557-566

  Sud, Avneesh ^a   Otaduy, Miguel A ^a   Manocha, Dinesh ^a  

^a University of North Carolina   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER HARDWARE; MATHEMATICAL MODELS; MOTION PLANNING; RANDOM PROCESSES;

DISTANCE FIELDS; GRAPHICS HARDWARE; PROXIMITY COMPUTATIONS; VORONOI REGIONS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 4644231655     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2004.00787.x     Document Type: Conference Paper

References (32)

1. [BGKW95] BREU H., GIL J., KIRKPATRICK D., WERMAN M.: Linear time Euclidean distance transform and Voronoi diagram algorithms. IEEE Trans. Pattern Anal. Mach. Intell. 17 (1995), 529-533.
2. [Blo97] BLOOMENTHAL J. (Ed.): Introduction to Implicit Surfaces, vol. 391. Morgan-Kaufmann, 1997.
3. [BMW00] BREEN D., MAUCH S., WHITAKER R.: 3d scan conversion of csg models into distance, closest-point and color volumes. Proc. of Volume Graphics (2000), 135-158.
4. [CD85] CHEW L. P., DRYSDALE, III R. L.: Voronoi diagrams based on convex distance functions. In ACM Symposium on Computational Geometry (1985), pp. 235-244.
5. [COLS97] COHEN-OR D., LEVIN D., SOLOMOVICI A.: Three-dimensional distance field metamorphosis. ACM Transactions on Graphics (1997).
6. [Cui99] CUISENAIRE O.: Distance Transformations: Fast Algorithms and Applications to Medical Image Processing. PhD thesis, Universite Catholique de Louvain, 1999.
7. [Dan80] DANIELSSON P. E.: Euclidean distance mapping. Computer Graphics and Image Processing 14 (1980), 227-248.
8. [Den03] DENNY M.: Solving geometric optimization problems using graphics hardware. Computer Graphics Forum 22, 3 (2003).
9. [FLM03] FOSKEY M., LIN M., MANOCHA D.: Efficient computation of a simplified medial axis. Proc. of ACM Solid Modeling (2003), 96-107.
10. [FPRJ00] FRISKEN S., PERRY R., ROCXWOOD A., JONES R.: Adaptively sampled distance fields: A general representation of shapes for computer graphics. In Proc. of ACM SIGGRAPH (2000), pp. 249-254.
11. [Gib98] GIBSONS.: Using distance maps for smooth representation in sampled volumes. In Proc. of IEEE Volume Visualization Symposium (1998), pp. 23-30.
12. [GL02] GARBER M., LIN M.: Constraint-based motion planning using voronoi diagrams. Proc. Fifth International Workshop on Algorithmic Foundations of Robotics (2002).
13. [GLW*04] GOVINDARAJU N., LLOYD B., WANG W., LIN M., MANOCHA D.: Fast computation of database operations using graphics processors. Proc. of ACM SIGMOD (2004).
14. [HCK*99] HOFF K., CULVER T., KEYSER J., LIN M., MANOCHA D.: Fast computation of generalized voronoi diagrams using graphics hardw are. Proceedings of ACM SIGGRAPH (1999), 277-286.
15. [HHVW96] HE T., HONG L., VARSHNEY A., WANG S.: Controlled topology simplification. IEEE Transactions on Visualization and Computer Graphics 2, 2 (1996), 171-184.
16. [HMK*97] HONG L., MURAKI S., KAUFMAN A., BARTZ D., HE T.: Virtual voyage: Interactive navigation in the human colon. Proc. of ACM SIGGRAPH (1997), 27-34.
17. [HZLM01] HOFF K., ZAFERAKIS A., LIN M., MANOCHA D.: Fast and simple 2d geometric proximity queries using graphics hardware. Proc. of ACM Symposium on Interactive 3D Graphics (2001), 145-148.
18. [HZLM02] HOFF K., ZAFERAKIS A., LIN M., MANOCHA D.: Fast 3d Geometric Proximity Queries Between Rigid and Deformable Models Using Graphics Hardware Acceleration. Tech. Rep. TR02-004, Department of Computer Science, University of North Carolina, 2002.
19. [KBSS01] KOBBBLT L., BOTSCH M., SCHWANECKE U., SEIDEL H. P.: Feature-sensitive surface extraction from volume data. In Proc. of ACM SIGGRAPH (2001), pp. 57-66.
20. [KVLM03] KIM Y., VARADHAN G., LIN M., MANOCHA D.: Efficient swept volume approximation of complex polyhedral models. Proc. of ACM Symposium on Solid Modeling and Applications (2003), 11-22.
21. [Lin93] LIN M.: Efficient Collision Detection for Animation and Robotics. PhD thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, December 1993.
22. [Mau03] HAUCH S.: Efficient Algorithms for Solving Static Hamilton-Jacobi Equations. PhD thesis, Califarna Institute of Technology, 4 2003.
23. [MQR03] MAURER C., QI R., RAGHAVAN V.: A linear time algorithm for computing exact euclidean distance transforms of binary images in arbitary dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 2 (February 2003), 265-270.
24. [Mul92] MULLIKIN J.C.: The vector distance transform in two and three dimensions. CVGIP: Graphical Models and Image Processing 54, 6 (Nov. 1992), 526-535.
25. [PF01] PERRY R., FRISKEN S.: Kizamu: A system for sculpting digital characters. In Proc. of ACM SIGGRAPH (2001), pp. 47-56.
26. [Set99] SETHIAN J. A.: Level set methods and fast marching methods. Cambridge, 1999.
27. [SFYC96] SHEKHAR R., FAYYAD E., YAGEL R., CORNHILL F.: Octree-based decimation of marching cubes surfaces. Proc. of IEEE Visualization (1996), 335-342.
28. [SM03] SUD A., MANOCHA D.: Fast Distance Field Computation Using Graphics Hardware. Tech. Rep. TR03-026, Dept. of Computer Science, University of North Carolina, 2003.
29. [SPG03] SIGG C., PEIKERT R., GROSS M.: Signed distance transform using graphics hardware. In Proceedings of IEEE Visualization (2003).
30. [VKKM03] VARADHAN G., KRISHNAN S., KIM Y., MANOCHA D.: Feature-sensitive subdivision and isosurface reconstruction. Proc. of IEEE Visualization (2003).
31. [VKSM04] VARADHAN G., KRISHNAN S., SRIRAM T. V. N., MANOCHA D.: Topology Preserving Surface Extraction using Adaptive Subdivision. Tech. rep., Department of Computer Science, University of North Carolina, 2004.
32. [VO97] VLEUOELS J., OVERMARS M.: Approximating Voronoi diagrams of convex sites in any dimension. International Journal of Computational Geometry and Applications 8 (1997), 201-222.