Computing a subgraph of the minimum weight triangulation (Q1327172): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0925-7721(94)90014-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1988781483
@@ Property / OpenAlex ID: W1988781483 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138934
@@ Property / cites work: Q3138934 / rank @@
+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 @@
+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 @@
+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 / cites work @@
+The \(\gamma\)-neighborhood graph
@@ Property / cites work: The \(\gamma\)-neighborhood graph / rank @@
+Normal rank