Minimum-weight triangulation

Known as: Minimum weight triangulation 
In computational geometry and computer science, the minimum-weight triangulation problem is the problem of finding a triangulation of minimal total… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1977-2018
051019772018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
A triangulation of a planar point set <i>S</i> is a maximal plane straight-line graph with vertex set <i>S</i>. In the <i>minimum… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2006
2006
The MINIMUM WEIGHT TRIANGULATION problem is to find a triangulation T* of minimum length for a given set of points P in the… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 5.1
  • figure 5.2
Is this relevant?
2005
2005
We describe a fixed parameter algorithm for computing the minimum weight triangulation (MWT) of a simple polygon with (n− k… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2004
2004
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
No polynomial-time algorithm is kno-ivn to compute t,he minimum weight triangulation (MWT) of a finite planar point set. In this… (More)
  • figure 2
  • figure 3
  • figure 5
  • table 1
  • figure 6
Is this relevant?
1996
1996
This paper settles the following two longstanding open problems: 1. What is the worst-case approximation ratio between the greedy… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
Given a set S of n points in the plane, a triangulation is a maximal set of non-intersecting edges connecting the points in S… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
1996
1996
that computes a subgraph of the minimum weight triangulation (A4WL”) of a general point set. The algorithm works by finding a… (More)
Is this relevant?
1996
1996
Two recent methods have increased hopes of finding a polynomial time solution to the problem of computing the minimum weight… (More)
Is this relevant?
1994
1994
Given a finite set of points in a plane, a triangulation is a maximal set of nonintersecting line segments connecting the points… (More)
Is this relevant?