Results 191 to 200 of about 7,016 (227)

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

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
Michael Jünger, Gerhard Reinelt, Doris Zepf   +2 more
openaire   +1 more source

Delaunay Triangulation with Transactions and Barriers

2007 IEEE 10th International Symposium on Workload Characterization, 2007
Transactional 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, Michael F. Spear, Luke Dalessandro, Virendra J. Marathe   +3 more
openaire   +1 more source

Morphological operations on Delaunay triangulations

Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002
Algorithms 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, Georges Stamon, Laurent Gallo, Nicole Cambou   +3 more
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 0006, Qiang Cai, Qiming Chen   +4 more
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

Optimistic parallel Delaunay triangulation

The Visual Computer, 2002
The paper describes a new parallel algorithm of Delaunay triangulation based on randomized incremental insertion. The algorithm is practical, simple and can be modified also for constrained triangulation or tetrahedralization. It was developed for architectures with a lower degree of parallelism, such as several-processor workstations, and tested on up
Ivana Kolingerová, Josef Kohout
openaire   +1 more source

Delaunay triangulation in three dimensions

IEEE Computer Graphics and Applications, 1995
Triangulation in two and higher dimensions began with Dirichlet, Voronoi, Thiessen, and Delaunay. A number of textbooks and papers have extensively covered the properties of triangulations and algorithms for their construction. Most dealt with theoretical aspects of the algorithms and gave upper bounds on their complexity.
Tsung-Pao Fang, Les A. Piegl
openaire   +1 more source

Fast Localized Delaunay Triangulation

2005
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost imposed by control information is limited and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents a localized algorithm that builds a
Filipe Araújo, Luís E. T. Rodrigues
openaire   +1 more source

Decremental Delaunay triangulation

ACM SIGGRAPH 99 Conference abstracts and applications, 1999
Richard Hammersley, Hongqian Lu
openaire   +1 more source