Greedy Triangulation acn be Efficiently Implemented in the Average Case (Extended Abstract)

Authors:
Andrzej Lingas
Affiliations:
-
Venue:
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1988

Citing 0
Cited 3

Fast greedy triangulation algorithms

SCG '94 Proceedings of the tenth 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
Eliminating contour line artefacts by using constrained edges

Computers & Geosciences

Quantified Score

Hi-index	0.00

Visualization

Abstract