Computational geometry: an introduction
Computational geometry: an introduction
The Greedy and Delaunay triangulations are not bad in the average case
Information Processing Letters
SCG '86 Proceedings of the second annual symposium on Computational geometry
Surface reconstruction and representation of 3-D scenes
Pattern Recognition
An ω(√n) lower bound for the nonoptimality of the greedy triangulation
Information Processing Letters
A heuristic triangulation algorithm
Journal of Algorithms
Constrained Delaunay triangulations
SCG '87 Proceedings of the third annual symposium on Computational geometry
An optimal algorithm for constructing the Delaunay triangulation of a set of line segments
SCG '87 Proceedings of the third annual symposium on Computational geometry
A linear-time algorithm for computing the Voronoi diagram of a convex polygon
Discrete & Computational Geometry
A space efficient greedy triangulation algorithm
Information Processing Letters
A new heuristic for minimum weight triangulation
SIAM Journal on Algebraic and Discrete Methods
Fixed-radius near neighbors search algorithms for points and segments
Information Processing Letters
Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract)
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
New Results for the Minimum Weight Triangulation Problem
New Results for the Minimum Weight Triangulation Problem
Triangulations intersect nicely
Proceedings of the eleventh annual symposium on Computational geometry
New algorithms and empirical findings on minimum weight triangulation heuristics (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
Implementations of the LMT heuristic for minimum weight triangulation
Proceedings of the fourteenth annual symposium on Computational geometry
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Eliminating contour line artefacts by using constrained edges
Computers & Geosciences
On generalized diamond spanners
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |