on a linear program for minimum weight triangulation arman yousefi and neal young university of...
TRANSCRIPT
![Page 1: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/1.jpg)
On a Linear Program for Minimum Weight Triangulation
Arman Yousefi and Neal Young
University of California, Riverside
full paper @ SODA 2012 / arxiv.org
![Page 2: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/2.jpg)
min-weight triangulation of a simple polygon
![Page 3: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/3.jpg)
min-weight triangulation of a simple polygon
• dynamic programming
• O(n3) time
![Page 4: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/4.jpg)
min-weight triangulation of a simple polygon
• dynamic programming
• O(n3) time
![Page 5: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/5.jpg)
min-weight triangulation of a simple polygon
• dynamic programming
• O(n3) time
![Page 6: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/6.jpg)
X
min-weight triangulation of a simple polygon
• dynamic programming
• O(n3) time
![Page 7: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/7.jpg)
X
min-weight triangulation of a simple polygon
• dynamic programming
• O(n3) time
![Page 8: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/8.jpg)
min-weight triangulation of a simple polygon
• dynamic programming
• O(n3) time
![Page 9: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/9.jpg)
[1979] Gilbert. New results on planar triangulations. [1980] Klincsek. Minimal triangulations of polygonal
domains.
• dynamic programming
• O(n3) time
min-weight triangulation of a simple polygon
![Page 10: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/10.jpg)
minimum weight triangulation (MWT)input: a set of points in the plane:
output:
![Page 11: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/11.jpg)
minimum weight triangulation (MWT)input: a set of points in the plane:
output: a triangulation T
![Page 12: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/12.jpg)
minimum weight triangulation (MWT)input: a set of points in the plane:
output: a triangulation T of minimum weight,
![Page 13: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/13.jpg)
the Bible (1979)
![Page 14: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/14.jpg)
the Bible (1979)
![Page 15: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/15.jpg)
the Bible (1979)
![Page 16: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/16.jpg)
the Bible (1979)
MWTNP-Hard?In P?
![Page 17: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/17.jpg)
approximation algorithms [1987] Plaisted and Hong. O(log n)-approx A heuristic triangulation algorithm. [1996] Levcopoulos and Krznaric. O(1)-approx Quasi-greedy triangulations approximating the minimum weight triangulation. [2006] Remy and Steger. QPTAS A quasi-polynomial time approximation scheme for minimum weight triangulation.
hardness result [2006] Mulzer and Rote. 25 years after G+J! NP-HARD
Minimum weight triangulation is NP-hard.
![Page 18: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/18.jpg)
heuristics! edges that can’t be in any MWT:
diamond test
[1989 Das and Joseph; 2001 Drysdale et al.]
a b
![Page 19: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/19.jpg)
heuristics! edges that can’t be in any MWT:
diamond test
[1989 Das and Joseph; 2001 Drysdale et al.]
aπ/4.6
b
![Page 20: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/20.jpg)
edges that can’t be in any MWT: diamond test
[1989 Das and Joseph; 2001 Drysdale et al.]
edges that have to be in every MWT: mutual nearest neighbors [1979 Gilbert; 1994 Yang et al]
β-skeleton [1993 Keil; 1995 Yang; 1996 Cheng and Xu]
locally minimal triangulation (“LMT-skeleton”) [1997 Dickerson et al; 1998 Beirouti and Snoeyink; 1996 Cheng et al;
1999 Aichholzer et al; 1996 Belleville et al; 2002 Bose et al]
aπ/4.6
b
heuristics!
![Page 21: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/21.jpg)
heuristics!
1. The boundary edges have to be in the MWT.
![Page 22: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/22.jpg)
heuristics!
2. Use the heuristics to find more edges that have to be in the MWT.
![Page 23: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/23.jpg)
heuristics!
if you’re lucky... found edges connect all points to boundary.Then remaining regions are simple polygons.
![Page 24: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/24.jpg)
heuristics!
3. Triangulate each remaining region optimally using the dynamic-programming algorithm.
![Page 25: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/25.jpg)
heuristics!
3. Triangulate each remaining region optimally using the dynamic-programming algorithm.
![Page 26: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/26.jpg)
This approach solves most random 40,000-point instances. [Dickerson et al. '97]
But.. for random instances, heuristics leave (in expectation) Ω(n) internal components
(but hidden constant is astronomically small, 10-51).
[Bose et al. '02]
heuristics
![Page 27: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/27.jpg)
linear programs for MWT [1985] Dantzig et al. Triangulations (tilings) and certain block triangular matrices.
Subsequently studied in [1996 Loera et al; 2004 Kirsanov, etc...]
edge-based linear programs: [1997] Kyoda et al. A branch-and-cut approach for minimum weight triangulation. [1996] Kyoda. A study of generating minimum weight triangulation within
practical time. [1996] Ono et al. A package for triangulations. [1998] Tajima. Optimality and integer programming formulations of
triangulations in general dimension. [2000] Aurenhammer and Xu. Optimal triangulations.
![Page 28: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/28.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
![Page 29: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/29.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
![Page 30: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/30.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
![Page 31: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/31.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
![Page 32: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/32.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
![Page 33: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/33.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
![Page 34: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/34.jpg)
Dantzig et al’s triangle-based LP [1985]
minimize subject to
Exactly one of these triangles must be in the triangulation.
“Exact cover by triangles.”
![Page 35: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/35.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 36: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/36.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 37: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/37.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 38: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/38.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 39: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/39.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 40: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/40.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 41: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/41.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 42: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/42.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 43: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/43.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 44: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/44.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 45: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/45.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 46: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/46.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 47: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/47.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
![Page 48: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/48.jpg)
Integer vs. fractional MWT
Fractional MWTEach triangle has weight 1/2Integer MWT
Ratio of costs is about 1.001
![Page 49: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/49.jpg)
known results The integrality gap is at least 1.001 [2004 Kirsanov]
For simple-polygon instances, the LP finds the MWT. [1985 Dantzig et al; 1996 Loera et al; 2004 Kirsanov; etc]
![Page 50: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/50.jpg)
first new resultTHM 1: The integrality gap of the LP is constant.
![Page 51: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/51.jpg)
first new resultTHM 1: The integrality gap of the LP is constant.
proof idea:
As Levcopoulos and Krznaric [1996] show, their algorithm produces triangulation T of cost at most
O(1) times the MWT (optimal integer solution).
We show that their triangulation T has cost at most
O(1) times the optimal fractional LP solution.
![Page 52: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/52.jpg)
second new resultTHM 2: If the heuristics find the MWT for a given instance, then so does the LP.
![Page 53: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/53.jpg)
second new resultTHM 2: If the heuristics find the MWT for a given instance, then so does the LP.
proof idea:
If a heuristic shows that an edge is not in any MWT, we show that the optimal fractional triangulation cannot use the edge either.
If a heuristic shows that an edge is in every MWT, we show that the optimal fractional triangulation must use the edge fully as well.
Requires painstakingly adapting each analysis.
![Page 54: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/54.jpg)
X Y
Most heuristics based on local-improvement arguments.
For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation.
example
![Page 55: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/55.jpg)
X Y
Most heuristics based on local-improvement arguments.
For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation.
Then some triangle in the triangulation must cross (x,y):
example
![Page 56: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/56.jpg)
X Y
Most heuristics based on local-improvement arguments.
For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation.
Then some triangle in the triangulation must cross (x,y).
The triangulation must extend this triangle on each side:
example
![Page 57: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/57.jpg)
X Y
Most heuristics based on local-improvement arguments.
For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation.
Then some triangle in the triangulation must cross (x,y).
Continuing, the triangulation covers (x,y) locally
something like this:
example
![Page 58: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/58.jpg)
X Y
Most heuristics based on local-improvement arguments.
For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation.
One shows that, given the heuristic condition, this triangulation can be improved, contradicting MWT.
example
![Page 59: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/59.jpg)
X Y X Y
Most heuristics based on local-improvement arguments.
For example, a heuristic might show (x,y) is in every MWT by contradiction. Suppose (x,y) is not in a given triangulation.
One shows that, given the heuristic condition, this subtriangulation can be improved, contradicting MWT.
example
![Page 60: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/60.jpg)
X YX Y X Y
extending to fractional triangulation
example - extending to fractional MWTAssume for contradiction that (x,y) edge is not used fully(with total weight 1) in the fractional MWT.Some triangle that crosses (x,y) must have positive weight.
![Page 61: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/61.jpg)
X Y X Y X Y
example - extending to fractional MWT
extending to fractional triangulation
Assume for contradiction that (x,y) edge is not used fully(with total weight 1) in the fractional MWT.Some triangle that crosses (x,y) must have positive weight.
Can again find a sub-triangulation over (x,y) with positive wt.
![Page 62: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/62.jpg)
X Y X Y X Y
example - extending to fractional MWTAssume for contradiction that (x,y) edge is not used fully(with total weight 1) in the fractional MWT.Some triangle that crosses (x,y) must have positive weight.
Can again find a sub-triangulation over (x,y) with positive wt.But the triangles covering (x,y) may overlap!
Complicates argument, but is not fatal.extending to fractional triangulation
![Page 63: On a Linear Program for Minimum Weight Triangulation Arman Yousefi and Neal Young University of California, Riverside full paper @ SODA 2012 / arxiv.org](https://reader036.vdocument.in/reader036/viewer/2022070402/56649f225503460f94c3a730/html5/thumbnails/63.jpg)
open problems