On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Computers & Geosciences - Special issue on GeoComp 99- GeoComputation and the Geosciences
Higher order Delaunay triangulations
Computational Geometry: Theory and Applications
The Complexity of Rivers in Triangulated Terrains
Proceedings of the 8th Canadian Conference on Computational Geometry
Constrained higher order Delaunay triangulations
Computational Geometry: Theory and Applications
Towards a definition of higher order constrained Delaunay triangulations
Computational Geometry: Theory and Applications
Optimal higher order Delaunay triangulations of polygons
Computational Geometry: Theory and Applications
Embedding rivers in polyhedral terrains
Proceedings of the twenty-fifth annual symposium on Computational geometry
Optimization for first order Delaunay triangulations
Computational Geometry: Theory and Applications
Optimal higher order Delaunay triangulations of polygons
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On the number of higher order Delaunay triangulations
Theoretical Computer Science
A faster circle-sweep Delaunay triangulation algorithm
Advances in Engineering Software
Removing local extrema from imprecise terrains
Computational Geometry: Theory and Applications
On the number of higher order delaunay triangulations
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Optimization for first order delaunay triangulations
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Flooding countries and destroying dams
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
A new relative chain code in 3D
Pattern Recognition
Hi-index | 0.00 |
For hydrologic applications, terrain models should have few local minima, and drainage lines should coincide with edges. We show that triangulating a set of points with elevations such that the number of local minima of the resulting terrain is minimized is NP-hard for degenerate point sets. The same result applies when there are no degeneracies for higher-order Delaunay triangulations. Two heuristics are presented to reduce the number of local minima for higher-order Delaunay triangulations, which start out with the Delaunay triangulation. We give efficient algorithms for their implementation, and test on real-world data how well they perform. We also study another desirable drainage characteristic, few valley components, and how to obtain it for higher-order Delaunay triangulations. This gives rise to a third heuristic. Tables and visualizations show how the heuristics perform for the drainage characteristics on real-world data.