"Meshsweeper": Dynamic point-to-polygonal-mesh distance and applications

IEEE Transactions on Visualization and Computer Graphics

Volumn 7, Issue 1, 2001, Pages 47-61

  Guéziec, André ^a,b  

^a IEEE

^b Multigen Paradigm Inc   (United States)

Author keywords

Closest point; Dynamic queries; Multiresolution hierarchy; Priority process; Triangular mesh

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER SIMULATION;

DYNAMIC QUERIES; MULTIRESOLUTION HIERARCHY; TRIANGULAR MESH;

COMPUTER GRAPHICS;

EID: 0035030533     PISSN: 10772626     EISSN: None     Source Type: Journal    
DOI: 10.1109/2945.910820     Document Type: Article

References (46)

1. Skin: A constructive approach to modeling free-form shapes
2. Curved surfaces and coherence for non-penetrating rigid body simulation
3. A fast procedure for computing the distance between complex objects in three-dimensional space
4. Efficient collision detection for animation and robotics
5. Voronoi diagrams: A survey of a fundamental geometric data structure
6. Fast computation of generalized Voronoi diagrams using graphics hardware
7. Efficient structures for geometric data management
8. Progressive meshes
9. Multiresolution hierarchies on unstructured triangle meshes
10. Efficient distance computation between non-convex objects
11. Fast proximity queries with swept sphere volumes
12. Bound coherence for minimum distance computations
13. A method for registration of 3-D shapes
14. Fast and accurate shape-based registration
15. Obbtree: A hierarchical structure for rapid interference detection
16. A framework for efficient minimum distance computation
17. Efficient collision detection using bounding volume hierarchies of k-dops
18. Dynamic view-dependent simplification for polygonal models
19. View-dependent refinement of progressive meshes
20. Building and traversing a surface at variable resolution
21. Progressive TINs: Algorithms and applications
22. A framework for streaming geometry in VRML
23. Horizon computation and hierarchical triangulated terrain model
24. An iterative procedure for the polygonal approximation of plane curves
25. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
26. Appearance-preserving simplification
27. Error-bounded reduction of triangle meshes with multivariate data
28. Locally toleranced polygonal surface simplification
29. Surface simplification using quadric error metrics
30. New quadric metric for simplifying meshes with appearance attributes
31. Full-range approximation of triangulated polyhedra
32. I-COLLIDE: An interactive and exact collision detection system for large-scale
33. Interactive collision detection
34. Visualizing Hilbert curves
35. Context-based space filling curves
36. Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes
37. Euclidean distance mapping
38. Physically based modelling
39. Optimized geometry compression for real-time rendering
40. Geometry coding and VRML
41. A fast triangle-triangle intersection test
42. Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity