Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,291 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.
2009
2009
A Fast Algorithm for Constructing Constrained Delaunay Triangulation
N. M. Nam
,
H. Kiem
,
Nguyen Vinh Nam
IEEE-RIVF International Conference on Computing…
2009
Corpus ID: 15420696
This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are…
Expand
2008
2008
Constrained Delaunay Triangulation for Ad Hoc Networks
D. Satyanarayana
,
Seela Veerabhadreswara Rao
J. Comput. Networks Commun.
2008
Corpus ID: 16318530
Geometric spanners can be used for efficient routing in wireless ad hoc networks. Computation of existing spanners for ad hoc…
Expand
2006
2006
On the Stretch Factor of the Constrained Delaunay Triangulation
P. Bose
,
J. Keil
International Symposium on Voronoi Diagrams in…
2006
Corpus ID: 32705807
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are in P, let CDT(P, S) be the…
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
1999
1999
Triangulated spatial models and neighbourhood search: an experimental comparison with quadtrees
Christopher B. Jones
,
J. M. Ware
,
C. Eynon
The Visual Computer
1999
Corpus ID: 5768083
We describe a Delaunay triangulation-based algorithm to search for the nearest line or polygonal boundary to an arbitrary point…
Expand
1997
1997
Parallel constrained Delaunay triangulation
L. Chew
,
Nikos Chrisochoides
,
Florian Sukup
1997
Corpus ID: 115299021
In this
1995
1995
Construction Of the Constrained Delaunay Triangulation Of A Polygonal Domain
R. Klein
CAD Systems Development
1995
Corpus ID: 2647905
A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay…
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
1993
1993
Algorithm for constrained delaunay triangulation
Tsung-Pao Fang
,
L. Piegl
The Visual Computer
1993
Corpus ID: 38917976
A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along the…
Expand
1991
1991
Dynamic maintenance of Delaunay triangulations
T. C. Kao
,
D. Mount
,
A. Saalfeld
1991
Corpus ID: 16924210
We describe and analyze the complexity of a procedure for computing and updating a Delaunay triangulation of a set of points in…
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