@INPROCEEDINGS{Gumhold-2003-Intersection,
	AUTHOR = {Stefan Gumhold and Pavel Borodin and Reinhard Klein},
	TITLE = {Intersection Free Simplification},
	AFFILIATIONS = {CGV,GRIS,CGB},
	AREAS = {areagp},
	BOOKTITLE = {Proceedings of Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics},
	PAGES = {11--16},
  YEAR = {2003},
	MONTH = {February},
	CONFERENCE = {The 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics},
	KEYWORDS = {intersection-free simplification, pair contraction, collision detection},
	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.},
	URL = {http://cg.cs.uni-bonn.de/aigaion2root/attachments/gumhold-2003-intersection.pdf}
}