Skip to search formSkip to main contentSkip to account menu

Delaunay triangulation

Known as: Delaunay tessellation, Delaunay, Thiessen triangulation 
In mathematics and computational geometry, a Delaunay triangulation for a set P of points in a plane is a triangulation DT(P) such that no point in P… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A main result in this paper is the proof that proximal Delaunay triangulation regions are convex polygons. In addition, it is… 
2010
2010
Continuous and Discrete Methods in Computer Science.- Colorful Strips.- The Mono- and Bichromatic Empty Rectangle and Square… 
2006
2006
The algorithms of Delaunay triangulation are the main algorithms when establishing DEM. The algorithm of going forward beginning… 
2003
2003
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a… 
2003
2003
We show that the traditional criterion for a simplex to belong to the Delaunay triangulation of a point set is equivalent to a… 
2001
2001
The triangulation of constrained data set is widely used in Geographic Information System(GIS),geo-science,computational geometry… 
2000
2000
Algorithms are presented which allow us to perform morphological transformations on unorganised sets of points represented by… 
1996
1996
An algorithm for the surface grid generation is worked out, more precisely, the geometric object being a union of simple surfaces… 
1991
1991
We describe and analyze the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in… 
1989
1989
The purpose of this paper is to report on recent work aimed at improving the performance of the Delaunay triangulation algorithms…