Delaunay Triangulations


Abstract views: 62 / PDF downloads: 52

Authors

  • Soham Konar Thomas Worthington High School, Columbus, Ohio, United States

Keywords:

Computational Geometry, Delaunay Triangulations, Algorithms

Abstract

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

15-09-2020

How to Cite

Soham Konar. (2020). Delaunay Triangulations. International Journal of Mathematics And Its Applications, 8(3), 71–76. Retrieved from https://ijmaa.in/index.php/ijmaa/article/view/130

Issue

Section

Research Article