An Algorithm Of Semi-Delaunay Triangulation Of Points Cloud Scattered On Surface
The purpose of the paper is to generalize the Delaunay triangulation onto surfaces. A formal definition and appropriate algorithm are presented. Starting from plane domain Delaunay triangulation definition a theoretical approach is evolved which is a background for further considerations. It is prov...
Main Author: | Jan Kucwaj |
---|---|
Format: | Article |
Language: | English |
Published: |
AGH University of Science and Technology Press
2014-01-01
|
Series: | Computer Science |
Subjects: | |
Online Access: | http://journals.agh.edu.pl/csci/article/download/938/954 |
Similar Items
-
A Comprehensive Survey on Delaunay Triangulation: Applications, Algorithms, and Implementations Over CPUs, GPUs, and FPGAs
by: Yahia S. Elshakhs, et al.
Published: (2024-01-01) -
Where and how Ruppert’s algorithm fails
by: Alexander Rand
Published: (2022-11-01) -
Dirichlet energy of Delaunay meshes and intrinsic Delaunay triangulations
by: Ye, Zipeng, et al.
Published: (2021) -
Implementing Data-Dependent Triangulations with Higher Order Delaunay Triangulations
by: Natalia Rodríguez, et al.
Published: (2017-12-01) -
On the hyperbolicity of Delaunay triangulations
by: Walter Carballosa, et al.
Published: (2023-10-01)