Fast greedy triangulation algorithms. (Q2482901): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for computing the Voronoi diagram of a convex polygon
+Normal rank
@@ Property / cites work @@
+Piecewise-Linear Interpolation between Polygonal Slices
+Normal rank
@@ Property / cites work @@
+The complexity of finding fixed-radius near neighbors
+Normal rank
@@ Property / cites work @@
+On the average length of Delaunay triangulations
@@ Property / cites work: On the average length of Delaunay triangulations / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-radius near neighbors search algorithms for points and segments
+Normal rank
@@ Property / cites work @@
+SIMPLE ALGORITHMS FOR ENUMERATING INTERPOINT DISTANCES AND FINDING k NEAREST NEIGHBORS
+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 @@
+New results for the minimum weight triangulation problem
+Normal rank
@@ Property / cites work @@
+On the identification of the convex hull of a finite set of points in the plane
+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 @@
+Generalized Delaunay triangulation for planar graphs
+Normal rank
@@ Property / cites work @@
+Q4230362
@@ Property / cites work: Q4230362 / rank @@
+Normal rank
@@ Property / cites work @@
+The greedy triangulation can be computed from the Delaunay triangulation in linear time
+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 @@
+The greedy and Delaunay triangulations are not bad in the average case
+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 @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+�ber die konvexe H�lle von n zuf�llig gew�hlten Punkten
+Normal rank
@@ Property / cites work @@
+ENUMERATING INTERDISTANCES IN SPACE
@@ Property / cites work: ENUMERATING INTERDISTANCES IN SPACE / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiently updating constrained Delaunay triangulations
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0925-7721(97)89149-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2219094305
@@ Property / OpenAlex ID: W2219094305 / rank @@
+Normal rank