Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CCCG 2007, Ottawa, Ontario, August 2022, 2007 On (Pointed) Minimum Weight Pseudo-Triangulations
 

Summary: CCCG 2007, Ottawa, Ontario, August 20­22, 2007
On (Pointed) Minimum Weight Pseudo-Triangulations
Oswin Aichholzer
Franz Aurenhammer
Thomas Hackl
Bettina Speckmann§
Abstract
In this note we discuss some structural properties of
minimum weight (pointed) pseudo-triangulations.
1 Introduction
Optimal triangulations for a set of points in the plane
have been, and still are, extensively studied within Com-
putational Geometry. There are many possible opti-
mality criteria, often based on edge weights or angles.
One of the most prominent criteria is the weight of a
triangulation, that is, the total Euclidean edge length.
Computing a minimum weight triangulation (MWT) for
a point set has been a challenging open problem for
many years [4] and various approximation algorithms
were proposed over time; see e.g. [3] for a short survey.

  

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universität Graz
Speckmann, Bettina - Wiskunde en Informatica, Technische Universiteit Eindhoven
Technische Universität Graz, Institute for Software Technology

 

Collections: Computer Technologies and Information Sciences; Mathematics