Results 171 to 180 of about 681,623 (204)

Computing directional constrained Delaunay triangulations

Computers & Graphics, 2000
Abstract In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in Vigo (Technical Report LSI-95-UR-R, Universitat Politecnica de Catalunya, 1995; Computer & Graphics 1997;21(2):215–23) are presented.
Marc Vigo Anglada, Núria Pla Garcia
openaire   +2 more sources

On the Stretch Factor of the Constrained Delaunay Triangulation

2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006
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 constrained Delaunay triangulation of P with respect to S. Given any two visible points p, q \in P, we show that there exists a path from p to q in CDT(P, S), denoted SPCDT(p, q), such that every edge in the path has length at
Prosenjit Bose, J. Mark Keil
openaire   +1 more source

Constrained Delaunay Triangulation Using Delaunay Visibility

2006
An algorithm for constructing constrained Delaunay triangulation (CDT) of a planar straight-line graph (PSLG) is presented. Although the uniform grid method can reduce the time cost of visibility determinations, the time needed to construct the CDT is still long.
Yang, Yi-Jun, Zhang, Hui, Yong, Jun-Hai, Zeng, Wei, Paul, Jean-Claude, Sun, Jiaguang   +5 more
openaire   +1 more source

Constrained delaunay triangulations

Algorithmica, 1987
Given a set of n vertices in the plane together with a set of noncrossing, straight-line edges, the constrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the Delaunay triangulation.
openaire   +2 more sources

Efficiently updating constrained Delaunay triangulations

BIT, 1993
The Constrained Delaunay Triangulation of a set of obstacle line segments in the plane is the Delaunay triangulation of the endpoint set of these obstacles with the restriction that the edges set of the triangulation contains all these obstacles. In this paper we present an optimal \(\Theta(\log n + k)\) algorithm for inserting an obstacle line segment
openaire   +2 more sources

A Fast Algorithm for Constructing Constrained Delaunay Triangulation

2009 IEEE-RIVF International Conference on Computing and Communication Technologies, 2009
This paper presents a fast incremental insertion algorithm for constructing constrained Delaunay triangulation. Constraints are considered any kind of polygonal lines. The bottleneck of incremental Delaunay triangulation algorithm is the search for a triangle containing current integrating point.
Nguyen Minh Nam, Hoang Van Kiem, Nguyen Vinh Nam   +2 more
openaire   +2 more sources

Duality of constrained Voronoi diagrams and Delaunay triangulations

Algorithmica, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barry Joe, Cao An Wang
openaire   +2 more sources

Constrained Delaunay triangulation for multiresolution surface description

[1988 Proceedings] 9th International Conference on Pattern Recognition, 2003
The problem of building a constrained Delaunay triangulation (CDT) at different levels of resolution is considered for the hierarchical description of topographic surfaces. The surface is approximated at each level by a network of planar triangular faces having vertices at a subset of surface-specific points, such as peaks, pits, or passes, and ...
De Floriani Leila, Puppo Enrico
openaire   +2 more sources

A fast algorithm for generating constrained delaunay triangulations

Computers & Structures, 1993
A fast algorithm for generating constrained two-dimensional Delaunay triangulations by modifying the existing unconstrained Delaunay triangulations is described. The modification is that certain edges are forced to be present. Such Delaunay schemes automatically avoid the formation of long thin triangles and thus give high quality grids. The main steps
openaire   +2 more sources

A new skeletonization algorithm based on constrained Delaunay triangulation

ISSPA '99. Proceedings of the Fifth International Symposium on Signal Processing and its Applications (IEEE Cat. No.99EX359), 2003
A new skeletonization algorithm based on the constrained Delaunay triangulation (CDT) is proposed in this paper. The CDT partitions a shape into a set of nonoverlapping triangles which represent the shape's local symmetry properties and interconnecting relationships between branches.
Ju Jia Zou, Hung-Hsin Chang, Hong Yan 0001   +2 more
openaire   +1 more source