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

Constrained Delaunay triangulation

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
  • J. Shewchuk
  • Discret. Comput. Geom.
  • 2008
  • Corpus ID: 12461535
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Highly Cited
2006
Highly Cited
2006
In this paper we present a method for abstracting an environment represented using constrained Delaunay triangulations in a way… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2005
Highly Cited
2005
  • L. Chew
  • Algorithmica
  • 2005
  • Corpus ID: 6317590
Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2004
2004
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2000
2000
This work presents two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2000
Highly Cited
2000
I discuss algorithms for constructing constrained Delaunay triangulations (CDTs) in dimensions higher than two. If the CDT of a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
1996
Highly Cited
1996
Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
1993
1993
TheConstrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the… Expand
Highly Cited
1989
Highly Cited
1989
Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay… Expand
Highly Cited
1987
Highly Cited
1987
  • L. Chew
  • SCG '87
  • 1987
  • Corpus ID: 52804551
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is… Expand