Intersection free simplification

International Journal of Shape Modeling

Volumn 9, Issue 2, 2003, Pages 155-176

  Gumhold, Stefan ^a   Borodin, Pavel ^b   Klein, Reinhard ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF BONN   (Germany)

Author keywords

Collision detection; Intersection free simplification; Pair contraction

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS;

COLLISION DETECTION; INTERSECTION FREE SIMPLIFICATION; PAIR CONTRACTION; SURFACE REPRESENTATION;

COMPUTER GRAPHICS;

EID: 1642495626     PISSN: 02186543     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218654303000097     Document Type: Article

References (19)

1. N. Aspert, D. Santa-Cruz, and T. Ebrahimi. Mesh: Measuring error between surfaces using the hausdorff distance. In IEEE International Conference on Multimedia and Expo 2002 Proceedings, pages 705-708, 2002.
2. C. Bajaj and D. Schikore. Error-bounded reduction of triangle meshes with multivariate data. SPIE, 2656:34-45, 1996.
3. A. Ciampalini, P. Cignoni, C. Montani, and R. Scopigno. Multiresolution decimation based on global error. The Visual Computer, 13(5):228-246, 1997.
4. J. Cohen, A. Varshney, D. Manocha, G. Turk, H. Weber, P. Agarwal, F. P. Brooks, Jr., and W. Wright. Simplification envelopes. In SIGGRAPH 96 Conference Proceedings, pages 119-128, 1996.
5. M. de Berg, M. von Kreveld, M. Overmars, and O. Schwarzkopf. Computational Geometry: Chapter 3, pages 49-59. Springer, 1997.
6. M. Garland and P. S. Heckbert. Surface simplification using quadric error metrics. In SIGGRAPH 97 Conference Proceedings, pages 209-216, 1997.
7. A. Guéziec. Locally toleranced surface simplification. IEEE Transactions on Visualization and Computer Graphics, 5(2):168-189, 1999.
8. B. Hamann. A data reduction scheme for triangulated surface. Computer Aided Geometric Design, 11:197-214, 1994.
9. H. Hoppe. Progressive meshes. In SIGGRAPH 96 Conference Proceedings, pages 99-108, 1996.
10. R. Klein, G. Liebich, and W. Straßer. Mesh reduction with error control. In IEEE Visualization 96 Conference Proceedings, pages 311-318, 1996.
11. L. Kobbelt, S. Campagna, and H.-P. Seidel. A general framework for mesh decimation. In Proceedings of the 24th Conference on Graphics Interface, pages 43-50, 1998.
12. P. Lindstrom and G. Turk. Fast and memory efficient polygonal simplification. In IEEE Visualization 98 Conference Proceedings, pages 279-286, 1998.
13. J. Popović and H. Hoppe. Progressive simplicial complexes. In SIGGRAPH 97 Conference Proceedings, pages 217-224, 1997.
14. R. Ronfard and J. Rossignac. Full-range approximation of triangulated polyhedra. Computer Graphics Forum, 15(3):67-76, C462, 1996.
15. J. Rossignac and P. Borrel. Multi-resolution 3d approximations for rendering complex scenes. Modeling in Computer Graphics: Methods and Applications, pages 455-465, 1993.
16. W. J. Schroeder, J. A. Zarge, and W. E. Lorensen. Decimation of triangle meshes. In SIGGRAPH 92 Conference Proceedings, pages 65-70, 1992.
17. O. G. Staadt and M. H. Gross. Progressive tetrahedralizations. In IEEE Visualization 98 Conference Proceedings, pages 397-404, 1998.
18. G. Zachmann. Optimizing the collision detection pipeline. In The First International Game Technology Conference GTEC, January 2001.
19. S. Zelinka and M. Garland. Permission grids: practical, error-bounded simplification. ACM Transactions on Graphics, 21(2):207-229, 2002.