Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 211,141,019 papers from all fields of science
Search
Sign In
Create Free Account
Constrained Delaunay triangulation
In computational geometry, a constrained Delaunay triangulation is a generalization of the Delaunay triangulation that forces certain required…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Chew's second algorithm
Computational geometry
Delaunay triangulation
List of algorithms
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
Sweep‐line algorithm for constrained Delaunay triangulation
V. Domiter
,
B. Žalik
International Journal of Geographical Information…
2008
Corpus ID: 45050677
This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining…
Expand
2004
2004
Constrained Delaunay Triangulation using Plane Subdivision
V. Domiter
2004
Corpus ID: 1875372
This paper presents an algorithm for obtaining a constrained Delaunay triangulation from a given planar graph. The main advantage…
Expand
Highly Cited
2000
Highly Cited
2000
Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations
J. Shewchuk
SCG '00
2000
Corpus ID: 15874083
I discuss algorithms for constructing constrained Delaunay triangulations (CDTs) in dimensions higher than two. If the CDT of a…
Expand
1999
1999
Three-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach
P. R. Cavalcanti
,
U. Mello
International Meshing Roundtable Conference
1999
Corpus ID: 11980096
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In…
Expand
1997
1997
Parallel constrained Delaunay triangulation
L. Chew
,
N. Chrisochoides
,
Florian Sukup
1997
Corpus ID: 115299021
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight line…
Expand
Highly Cited
1996
Highly Cited
1996
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
J. Shewchuk
Workshop on Applied Computational Geometry
1996
Corpus ID: 14356403
Triangle is a robust implementation of two-dimensional constrained Delaunay triangulation and Ruppert's Delaunay refinement…
Expand
1993
1993
Efficiently updating constrained Delaunay triangulations
C. Wang
BIT
1993
Corpus ID: 8160152
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
Constrained delaunay triangulations
L. Paul Chew
1989
Corpus ID: 189918468
Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay…
Expand
Highly Cited
1989
Highly Cited
1989
Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation
T. Baker
Engineering computations
1989
Corpus ID: 41810825
This paper describes a method for generating tetrahedral meshes. The algorithm, based on the Delaunay triangulation, can treat…
Expand
Highly Cited
1987
Highly Cited
1987
Constrained Delaunay triangulations
L. Chew
SCG '87
1987
Corpus ID: 6317590
Given a set of n vertices in the plane together with a set of noncrossing edges, the constrained Delaunay triangulation (CDT) is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE