Results 161 to 170 of about 7,960 (210)
Some of the next articles are maybe not open access.
Algorithm for constrained delaunay triangulation
The Visual Computer, 1994A direct algorithm for computing constrained Delaunay triangulation in 2-D is presented. The algorithm inserts points along the constrained edges (break lines) to maintain the Delaunay criterion. Since many different insertions are possible, the algorithm computes only those that are on the Delaunay circles of each intersected triangle.
Tsung-Pao Fang, Les A. Piegl
openaire +1 more source
The Delaunay constrained triangulation: the Delaunay stable algorithms
1999 IEEE International Conference on Information Visualization (Cat. No. PR00210), 2003Delaunay triangulation is well known for its use in geometric design. A derived version of this structure, the Delaunay constrained triangulation, takes into account the triangular mesh problem in presence of rectilinear constraints. The Delaunay constrained triangulation is very useful for CAD, topography and mapping and in finite element analysis ...
L. Rognant +3 more
openaire +1 more source
Constrained Delaunay Triangulation Using Delaunay Visibility
2006An 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 +5 more
openaire +1 more source
Image Completion Using Constrained Delaunay Triangulation
2011 Fourth International Conference on Intelligent Computation Technology and Automation, 2011In this paper, we proposed a novel algorithm of automatic image structure completion. Different from traditional image completion algorithms directly copying patches from the unknown region to the damaged part, our completion approach first reconstructs the geometry structures in the damaged region with edges inferred by Constrained Delaunay ...
Han Zhou +3 more
openaire +1 more source
Constrained delaunay triangulations
Algorithmica, 1987Given 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 +1 more source
Computing constrained triangulation and Delaunay triangulation: a new algorithm
IEEE Transactions on Magnetics, 1990A novel algorithm for computing optimal constrained triangulation is presented which is equally applicable to 2-D and 3-D optimal constrained triangulation and Delaunay triangulation. This algorithm has no degenerate and near-degenerate problems. The same amount of time is needed to add a new point to an existing mesh of any element number provided ...
null Zhou Jian-Ming +3 more
openaire +1 more source
Parallel constrained Delaunay triangulation on the GPU
International Journal of Geographical Information Science, 2017In this paper, we propose a new graphics processing unit GPU method able to compute the 2D constrained Delaunay triangulation CDT of a planar straight-line graph consisting of points and segments. All existing methods compute the Delaunay triangulation of the given point set, insert all the segments, and then finally transform the resulting ...
Narcís Coll, Marité Guerrieri
openaire +1 more source
Constrained Delaunay triangulation for multiresolution surface description
[1988 Proceedings] 9th International Conference on Pattern Recognition, 2003The 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
Efficiently updating constrained Delaunay triangulations
BIT, 1993The 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
Sweep‐line algorithm for constrained Delaunay triangulation
International Journal of Geographical Information Science, 2008This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining edges. It has various applications in geographical information system (GIS), for example, iso-lines triangulation or the triangulation of polygons in land cadastre. The presented algorithm uses a sweep-line paradigm combined
V. Domiter, B. Žalik
openaire +1 more source