Location of Repository

Fixed parameter algorithms for minimum weight partitions

By Magdalene Grantson, Christian Borgelt and Christos Levcopoulos

Abstract

Abstract. We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (n − k) vertices on the perimeter and k hole vertices in the interior, that is, for a total of n vertices. We show that with our algorithm the minimum weight triangulation can be found in time at most O(n 4 4 k k), and thus in time polynomial in n if k ≤ O(log n). We implemented our algorithm in Java and report experiments backing our analysis.

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.161.7040
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://fuzzy.cs.uni-magdeburg.... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.