Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019): Difference between revisions

@@ Property / author @@
+Henk G. Meijer
@@ Property / author: Henk G. Meijer / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / 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 @@
+The greedy and Delaunay triangulations are not bad in the average case
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(92)90129-j
+Normal rank
@@ Property / OpenAlex ID @@
+W2091743544
@@ Property / OpenAlex ID: W2091743544 / rank @@
+Normal rank