Fast algorithms for greedy triangulation (Q1196458): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for computing the Voronoi diagram of a convex polygon
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+A space efficient greedy triangulation algorithm
@@ Property / cites work: A space efficient greedy triangulation algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Delaunay triangulation for planar graphs
+Normal rank
@@ Property / cites work @@
+On approximation behavior of the greedy triangulation for convex polygons
+Normal rank
@@ Property / cites work @@
+Heuristics for optimum binary search trees and minimum weight triangulation problems
+Normal rank
@@ Property / cites work @@
+Voronoi diagrams with barriers and the shortest diagonal problem
+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 @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank