Skip to main content
SpringerLink
Log in

A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

A linear-time heuristic for minimum weight triangulation of convex polygons is presented. This heuristic produces a triangulation of length within a factor 1 + ε from the optimum, where ε is an arbitrarily small positive constant. This is the first subcubic algorithm that guarantees such an approximation factor, and it has interesting applications.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. christos@dna.lth.se., , , , , , SE

    C. Levcopoulos

  2. Department of Computer Science, Lund University, Box 118, S-221 00 Lund, Sweden. drago@dna.lth.se., , , , , , SE

    D. Krznaric

Authors
  1. C. Levcopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Krznaric
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received November 21, 1996; revised March 9, 1997.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levcopoulos, C., Krznaric, D. A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons . Algorithmica 21, 285–311 (1998). https://doi.org/10.1007/PL00009216

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00009216

Search

Navigation