Results 11 to 20 of about 26,216 (246)
On Deletion in Delaunay Triangulation [PDF]
Proceedings of the fifteenth annual symposium on Computational geometry, 1998 This paper presents how the space of spheres and shelling may be used to delete a point from a $d$-dimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this ...
Devillers, Olivier
core +12 more sources
Improved Incremental Randomized Delaunay Triangulation [PDF]
Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98, 1997 We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, and small memory occupation.
Olivier Devillers +5 more
core +16 more sources
Excitable Delaunay triangulations [PDF]
Kybernetes, 2011 In an excitable Delaunay triangulation every node takes three states (resting, excited and refractory) and updates its state in discrete time depending on a ratio of excited neighbours. All nodes update their states in parallel.
Andrew Adamatzky, Yi Lin
core +3 more sources
PROVABLY CONSISTENT DISTRIBUTED DELAUNAY TRIANGULATION [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 This paper deals with the distributed computation of Delaunay triangulations of massive point sets, mainly motivated by the needs of a scalable out-of-core surface reconstruction workflow from massive urban LIDAR datasets.
M. Brédif +3 more
doaj +1 more source
Incremental Delaunay Triangulation
The Insight Journal, 2012 This document describes the implementation in ITK of the Incremental Delaunay Triangulation algorithm. Using the Straight Walk in Triangulation function, the exact discrete geometrical orientation predicate, and the itk::QuadEdgeMesh API of ITK , we propose a geometrically exact and robust implementation that, from a given 2-dimensional itk::PointSet ...
Stéphane Rigaud, Alexandre Gouaillard
openalex +2 more sources
`Optimal' triangulation of surfaces and bodies [PDF]
, 1999 A new criterion is given for constructing an optimal triangulation of surfaces and bodies. The triangulation, called the {\em tight} triangulation, is convexity preserving and accepts long, thin triangles whenever they are useful. Both properties are not
Traas, C.R.
core +19 more sources
About Some Localization Problems in Delaunay Triangulations
Моделирование и анализ информационных систем, 2015 We study some problems of nodes localization in a Delaunay triangulation and problem-solving procedures. For the problem of the set of nodes the computationally efficient approach that uses Euclidean minimum spanning tree of Delaunay triangulation is ...
N. F. Dyshkant
doaj +3 more sources
Unsupervised Machine Learning for Improved Delaunay Triangulation
Journal of Marine Science and Engineering, 2021 Physical oceanography models rely heavily on grid discretization. It is known that unstructured grids perform well in dealing with boundary fitting problems in complex nearshore regions.
Tao Song +7 more
doaj +1 more source
Parallelism-Oriented Dynamic Incremental Delaunay Triangulation Algorithm
Jisuanji kexue yu tansuo, 2020 Delaunay triangulation is a main topic in computer graphics. Various types of new requirements have appeared during the development of parallel triangulation algorithms, e.g., updating the triangulation incrementally given a set of increasing points ...
YANG Haoyu, LIU Li, ZHANG Cheng, YU Hao
doaj +1 more source
Improved Fingerprint Indexing Based on Extended Triangulation
IEEE Access, 2021 A simple fingerprint identification scheme compares an input fingerprint with all the fingerprints in the database to find any matching fingerprint. That is, the simple matching method considers all fingerprints in the database as candidates for a given ...
Sanghoon Lee, Ik Rae Jeong
doaj +1 more source