New results for the minimum weight triangulation problem (Q1343467): Difference between revisions

@@ Property / cites work @@
+Q3948568
@@ Property / cites work: Q3948568 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+New results for the minimum weight triangulation problem
+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 @@
+On approximation behavior of the greedy triangulation for convex polygons
+Normal rank
@@ Property / cites work @@
+Fast algorithms for greedy triangulation
@@ Property / cites work: Fast algorithms for greedy triangulation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3311658
@@ Property / cites work: Q3311658 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Heuristic for Minimum Weight Triangulation
@@ Property / cites work: A New Heuristic for Minimum Weight Triangulation / rank @@
+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
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01188718
+Normal rank
@@ Property / OpenAlex ID @@
+W1994135781
@@ Property / OpenAlex ID: W1994135781 / rank @@
+Normal rank