Summary: Triangulations Match Intersect Nicely
Oswin Aichholzer
Franz Aurenhammer
Michael Taschwer
Institute for Theoretical Computer Science
Graz University of Technology
Klosterwiesgasse 32/2, A­8010 Graz, Austria
e­mail: foaich,aureng@igi.tu­graz.ac.at
G¨ unter Rote
Institut f¨ ur Mathematik
Technische Universit¨ at Graz
Steyrergasse 30
A­8010 Graz, Austria
e­mail: rote@ftug.dnet.tu­graz.ac.at
Abstract
We prove that two different triangulations of the
same planar point set always intersect in a sys­
tematic manner, concerning both their edges and
their triangles. As a consequence, improved lower
bounds on the weight of a triangulation are ob­

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universität Graz
Technische Universität Graz, Institute for Software Technology

Collections: Computer Technologies and Information Sciences