Results 141 to 150 of about 456 (184)
Some of the next articles are maybe not open access.
Realizability of delaunay triangulations
Information Processing Letters, 1990zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael B Dillencourt
exaly +2 more sources
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
Hexagonal Delaunay Triangulation
2009We present a novel and robust algorithm for triangulating point clouds in ℝ2. It is based on a highly adaptive hexagonal subdivision scheme of the input domain. That hexagon mesh has a dual triangular mesh with the following properties: any angle of any triangle lies in the range between 43.9° and 90°, the aspect ratio of triangles is bound ...
Gerd Sußner, Günther Greiner
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
Almost regular Delaunay‐triangulations
International Journal for Numerical Methods in Engineering, 1997A regular triangulation has six triangles meet at every interior point and three at every boundary point. Obviously, this cannot be achieved for most polygonal domains because of angle constraints. The author proposes to determine the adjustment of a first grid by looking to the minimum of a penalty function chosen to measure deviation from regularity.
openaire +2 more sources
Computing correct Delaunay triangulations
Computing, 1991Technical questions about numerically stable computation of Delaunay triangulation and Voronoj diagram are investigated. The discussion is with respect to planar \(M\times M\) lattice where all generating points are supposed to be located. From \(M\) and underlying metrics \((L_ 1,L_ 2,L_ \infty)\) the necessary computer word length is derived. Correct
Michael Jünger +2 more
openaire +1 more source
Delaunay Triangulation with Transactions and Barriers
2007 IEEE 10th International Symposium on Workload Characterization, 2007Transactional memory has been widely hailed as a simpler alternative to locks in multithreaded programs, but few nontrivial transactional programs are currently available. We describe an open-source implementation of Delaunay triangulation that uses transactions as one component of a larger parallelization strategy. The code is written in C+ +, for use
Michael L. Scott +3 more
openaire +1 more source
Morphological operations on Delaunay triangulations
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002Algorithms are presented which allow us to perform morphological transformations on unorganised sets of points represented by their Delaunay triangulation. The results show that these algorithms could behave as morphological operators such as erosion, dilatation, and opening do. They actually act as "shape filters".
Nicolas Loménie +3 more
openaire +1 more source
Complex conforming Delaunay triangulation
Science China Information Sciences, 2010A novel algorithm of conforming Delaunay triangulation for curved geometry is presented in the paper. A progress has been made for the problem puzzled Delaunay refinement where curved constraints cannot be accepted as input directly. The algorithm is based on a new sufficient condition for the existence of constraints in triangulation.
Xianhai Meng +4 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