Constrained Delaunay triangulation

In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Sample point distributions possessing blue noise spectral characteristics play a central role in computer graphics, but are… (More)
Is this relevant?
2010
2010
Vectorization, i.e. raster-to-vector conversion, is a central part of graphics recognition problems. Graphics recognition is… (More)
  • figure 2
  • figure 4
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
This paper proposes a path planning algorithm for determining an optimal path with respect to the costs of a dual graph on the… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2006
2006
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2004
2004
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
2003
The problem of determining whether a polyhedron has a constr ai ed Delaunay tetrahedralization is NPcomplete. However, if no five… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Triangle is a C program for two-dimensional mesh generation and construction of Delaunay triangulations, constrained Delaunay… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1994
1994
A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along the… (More)
  • figure 1
  • figure 3
  • figure 9
  • figure 10
  • table 1
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is… (More)
Is this relevant?