Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Towards Compatible Triangulations Oswin Aichholzer a;1 Franz Aurenhammer a Ferran Hurtado b;2
 

Summary: Towards Compatible Triangulations
Oswin Aichholzer a;1 Franz Aurenhammer a Ferran Hurtado b;2
Hannes Krasser a;3
a Institute for Theoretical Computer Science, Graz University of Technology, Graz,
Austria
b Departament de Matematica Aplicada II, Universitat Politecnica de Catalunya,
Barcelona, Spain
Abstract
We state the following conjecture: any two planar n-point sets (that agree on the
number of convex hull points) can be triangulated in a compatible manner, i.e., such
that the resulting two triangulations are topologically equivalent. The conjecture is
proved true for point sets with at most three interior points. We further exhibit a
class of point sets which can be triangulated compatibly with any other set that
satis es the obvious size and hull restrictions. Finally, we prove that adding a small
number of extraneous points (the number of interior points minus two) always allows
for compatible triangulations.
1 Introduction
Can any two planar point sets (that agree on the number of points and extreme
points) be triangulated in a compatible manner? This intuitive question is the
topic of the present paper. Apart from the theoretical interest in this basic

  

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

 

Collections: Computer Technologies and Information Sciences