OPTIMAL TRIANGULATIONS OF POINTS AND SEGMENTS WITH STEINER POINTS (Q5305065): Difference between revisions

@@ Property / author @@
-Boris Aronov
@@ Property / author: Boris Aronov / rank @@
-Normal rank
@@ Property / author @@
-Tetsuo Asano
@@ Property / author: Tetsuo Asano / rank @@
-Normal rank
@@ Property / author @@
+Boris Aronov
@@ Property / author: Boris Aronov / rank @@
+Normal rank
@@ Property / author @@
+Tetsuo Asano
@@ Property / author: Tetsuo Asano / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Edge insertion for optimal triangulations
@@ Property / cites work: Edge insertion for optimal triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulating a simple polygon in linear time
@@ Property / cites work: Triangulating a simple polygon in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Laplacian smoothing and Delaunay triangulations
@@ Property / cites work: Laplacian smoothing and Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Almost tight upper bounds for vertical decompositions in four dimensions
+Normal rank
@@ Property / cites work @@
+Generalized Delaunay triangulation for planar graphs
+Normal rank
@@ Property / cites work @@
+Minimum-weight triangulation is NP-hard
@@ Property / cites work: Minimum-weight triangulation is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q4325546
@@ Property / cites work: Q4325546 / rank @@
+Normal rank
@@ Property / cites work @@
+A subexponential bound for linear programming
@@ Property / cites work: A subexponential bound for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Delaunay refinement algorithms for triangular mesh generation
+Normal rank