Skip to search formSkip to main content
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.
2008
2008
This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining… Expand
Is this relevant?
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
Is this relevant?
Highly Cited
2005
Highly Cited
2005
  • T. Baker
  • Engineering with Computers
  • 2005
  • Corpus ID: 41810825
This paper describes a method for generating tetrahedral meshes. The algorithm, based on the Delaunay triangulation, can treat… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
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
Is this relevant?
1999
1999
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
Is this relevant?
1999
1999
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
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
Is this relevant?
1993
1993
  • C. Wang
  • BIT Comput. Sci. Sect.
  • 1993
  • Corpus ID: 8160152
TheConstrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the… Expand
Is this relevant?
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
Is this relevant?
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
Is this relevant?