Results 201 to 210 of about 26,216 (246)

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   +1 more source

Almost regular Delaunay‐triangulations

International Journal for Numerical Methods in Engineering, 1997
A 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

Parallel 3D Delaunay Triangulation

Computer Graphics Forum, 1993
AbstractThe paper deals with the parallelization of Delaunay triangulation algorithms, giving more emphasis to pratical issues and implementation than to theoretical complexity. Two parallel implementations are presented. The first one is built on De Wall, an Ed triangulator based on an original interpretation of the divide & conquer paradigm.
Cignoni P, Montani C, Perego R, Scopigno R   +3 more
openaire   +2 more sources

Realizability of delaunay triangulations

Information Processing Letters, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Computing correct Delaunay triangulations

Computing, 1991
Technical 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
Jünger, M., Reinelt, G., Zepf, D.
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

Hexagonal Delaunay Triangulation

2009
We 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

Complex conforming Delaunay triangulation

Science China Information Sciences, 2010
A 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, JiGang Li, Qin Yang, Qiang Cai, QiMing Chen   +4 more
openaire   +1 more source

Fast range searching with Delaunay Triangulations

GeoInformatica, 1997
Summary: This paper studies the idea of answering range searching queries using simple data structures. The only data structure we need is the Delaunay Triangulation of the input points. The idea is to first locate a vertex of the (arbitrary) query polygon \({\mathcal Q}\) and walk along the boundary of the polygon in the Delaunay Triangulation and ...
openaire   +1 more source