Meny

Du är här

Fixed parameter algorithms for the minimum weight triangulation problem

Författare:
Publiceringsår: 2008
Språk: Engelska
Sidor: 185-220
Publikation/Tidskrift/Serie: International Journal of Computational Geometry and Applications (IJCGA)
Volym: 18
Nummer: 3
Dokumenttyp: Artikel
Förlag: World Scientific Publishing Co

Sammanfattning

We discuss and compare four fixed parameter algorithms for finding the minimum weight triangulation of a simple polygon with (n - k) vertices on the perimeter and k vertices in the interior (hole vertices), that is, for a total of n vertices. All four algorithms rely on the same abstract divide-and-conquer scheme, which is made efficient by a variant of dynamic programming. They are essentially based on two simple observations about triangulations, which give rise to triangle splits and paths splits. While each of the first two algorithms uses only one of these split types, the last two algorithms combine them in order to achieve certain improvements and thus to reduce the time complexity. By discussing this sequence of four algorithms we try to bring out the core ideas as clearly as possible and thus strive to achieve a deeper understanding as well as a simpler specification of these approaches. In addition, we implemented all four algorithms in Java and report results of experiments we carried out with this implementation.

Disputation

Nyckelord

  • Technology and Engineering
  • divide-and-conquer algorithm
  • programming
  • dynamic
  • fixed parameter algorithm
  • minimum weight triangulation

Övriga

Published
  • VR 2005-4085
Yes
  • ISSN: 0218-1959

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen