International Symposium on Algorithms and Computation

ISAAC 2005: Algorithms and Computation pp 984-994

Minimum Weight Triangulation by Cutting Out Triangles

  • Magdalene Grantson
  • Christian Borgelt
  • Christos Levcopoulos
Conference paper

DOI: 10.1007/11602613_98

Volume 3827 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Grantson M., Borgelt C., Levcopoulos C. (2005) Minimum Weight Triangulation by Cutting Out Triangles. In: Deng X., Du DZ. (eds) Algorithms and Computation. ISAAC 2005. Lecture Notes in Computer Science, vol 3827. Springer, Berlin, Heidelberg

Abstract

We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (nk) vertices on the perimeter and k hole vertices in the interior, that is, for a total of n vertices. Our algorithm is based on cutting out empty triangles (that is, triangles not containing any holes) from the polygon and processing the parts or the rest of the polygon recursively. We show that with our algorithm a minimum weight triangulation can be found in time at most O(n3k ! k), and thus in O(n3) if k is constant. We also note that k! can actually be replaced by bk for some constant b. We implemented our algorithm in Java and report experiments backing our analysis.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Magdalene Grantson
    • 1
  • Christian Borgelt
    • 2
  • Christos Levcopoulos
    • 1
  1. 1.Department of Computer ScienceLund UniversityLundSweden
  2. 2.Department of Knowledge Processing and Language EngineeringUniversity of MagdeburgMagdeburgGermany