Intersection Free Simplification

S. Gumhold, Pavel Borodin, and Reinhard Klein
In proceedings of The 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics, pages 11-16, Feb. 2003
Presented at The 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics
 

Abstract

Triangle mesh decimation and multi-resolution techniques are widely used in visualization applications for huge scenes. A large collection of different simplification algorithms exists in order to build a multi-resolution model from a given triangle mesh. None of the known techniques tries to avoid self-intersections during the simplification process. In this work we show that in real-world situations self-intersections lead to unacceptable results. We show how to avoid self-intersections in the case of vertex collapse simplification. This is done by parametrizing the contraction operations over time and by detecting collisions of affected simplices. For the case of a collision we examined different strategies to determine new target positions that avoid the collision. Experimental results show that our approach produces high quality simplified meshes without causing any new self-intersections.

Images

Download Paper

Download Paper

Additional Material

Bibtex

@INPROCEEDINGS{gumhold-2003-intersection,
      author = {Gumhold, S. and Borodin, Pavel and Klein, Reinhard},
       pages = {11--16},
       title = {Intersection Free Simplification},
   booktitle = {The 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics},
        year = {2003},
       month = feb,
    abstract = {Triangle mesh decimation and multi-resolution techniques are widely used in visualization
                applications for huge scenes. A large collection of different simplification algorithms exists in
                order to build a multi-resolution model from a given triangle mesh. None of the known techniques
                tries to avoid self-intersections during the simplification process. In this work we show that in
                real-world situations self-intersections lead to unacceptable results. We show how to avoid
                self-intersections in the case of vertex collapse simplification. This is done by parametrizing the
                contraction operations over time and by detecting collisions of affected simplices. For the case of
                a collision we examined different strategies to determine new target positions that avoid the
                collision. Experimental results show that our approach produces high quality simplified meshes
                without causing any new self-intersections.},
  conference = {The 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics}
}