Delaunay Triangulations
Abstract views: 62 / PDF downloads: 52
Keywords:
Computational Geometry, Delaunay Triangulations, AlgorithmsAbstract
We examine a methodology to construct 3D maps. We assume the height above sea level is known only at a finite number of points. Mathematically, this problem is equivalent to reconstructing the graph of a function of two variables when the values of the function are only known at a finite number of points. This leads to a discussion of Delaunay triangulations and the algorithm to compute them. We illustrate the concept discussed with examples.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.