Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
The surfaces considered in surface reconstruction are 2-manifolds that might have boundaries and are embedded in some Euclidean… Expand
Highly Cited
2004
Highly Cited
2004
  • S. Fortune
  • Handbook of Discrete and Computational Geometry…
  • 2004
  • Corpus ID: 19663265
The Voronoi diagram of a set of sites partitions space into regions one per site the region for a site s consists of all points… Expand
  • figure 27.1
  • figure 27.1
  • table 27.3
Highly Cited
2003
Highly Cited
2003
We address the problem of curvature estimation from sampled smooth surfaces. Building upon the theory of normal cycles, we derive… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1997
Highly Cited
1997
Abstract : Delaunay refinement is a technique for generating unstructured meshes of triangles or tetrahedral suitable for use in… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Highly Cited
1997
Highly Cited
1997
Abstract This paper presents an experimental comparison of a number of different algorithms for computing the Delaunay… Expand
Highly Cited
1995
Highly Cited
1995
We present a simple new algorithm for triangulating polygons and planar straightline graphs, It provides "shape" and "size… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1994
Highly Cited
1994
  • V. T. Rajan
  • Discret. Comput. Geom.
  • 1994
  • Corpus ID: 34080186
In this paper we present new optimality results for the Delaunay triangulation of a set of points in ℝd. These new results are… Expand
Highly Cited
1991
Highly Cited
1991
In this paper we present new optimality results for the Delaunay triangulation of a set of points in ℝ d . These new results are… Expand
  • figure 1
  • figure 2
Highly Cited
1990
Highly Cited
1990
  • S. Rippa
  • Comput. Aided Geom. Des.
  • 1990
  • Corpus ID: 8422086
A set of scattered data in the plane consists of function values measured on a set of data points in R2. A surface model of this… Expand
  • figure 1
  • figure 2
Highly Cited
1986
Highly Cited
1986
We introduce the notion of generalized Delaunay triangulation of a planar straight-line graphG=(V, E) in the Euclidean plane and… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5