Polynomial-time instances of the minimum weight triangulation problem (Q1314524): Difference between revisions

@@ Property / cites work @@
+Q3138934
@@ Property / cites work: Q3138934 / rank @@
+Normal rank
@@ Property / cites work @@
+The concept of state in discrete dynamic programming
+Normal rank
@@ Property / cites work @@
+The farthest point Delaunay triangulation minimizes angles
+Normal rank
@@ Property / cites work @@
+Q4763388
@@ Property / cites work: Q4763388 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypersingular integrals in boundary element fracture analysis
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
+Normal rank
@@ Property / cites work @@
+Decomposing a Polygon into Simpler Components
@@ Property / cites work: Decomposing a Polygon into Simpler Components / rank @@
+Normal rank
@@ Property / cites work @@
+A note on Delaunay and optimal triangulations
@@ Property / cites work: A note on Delaunay and optimal triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal Triangulations of Polygonal Domains
@@ Property / cites work: Minimal Triangulations of Polygonal Domains / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy and Delaunay triangulations are not bad in the average case
+Normal rank
@@ Property / cites work @@
+Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation
+Normal rank
@@ Property / cites work @@
+A heuristic triangulation algorithm
@@ Property / cites work: A heuristic triangulation algorithm / rank @@
+Normal rank