Results 11 to 20 of about 7,016 (227)
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
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
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
A short proof of the toughness of Delaunay triangulations
Journal of Computational Geometry, 2021 We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough.
Ahmad Biniaz
doaj +1 more source
THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION [PDF]
International Journal of Computational Geometry & Applications, 1991 We give an expected-case analysis of Delaunay triangulations. To avoid edge effects we consider a unit-intensity Poisson process in Euclidean d-space, and then limit attention to the portion of the triangulation within a cube of side n1/d. For d equal to two, we calculate the expected maximum edge length, the expected minimum and maximum angles, and ...
Marshall W. Bern +2 more
openaire +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
Higher order Delaunay triangulations [PDF]
Computational Geometry, 2000 The authors introduce a \(k-\)OD triangulation in terms of some given number \(k\) of points. This generalizes the well known Delaunay triangulation [see \textit{L. P. Chew}, Algorithmica 4, No.~1, 97-108 (1989; Zbl 0664.68042)]. An efficient way to compute all useful \(k-\)OD edges of a point set is given.
Joachim Gudmundsson +2 more
openaire +5 more sources
An Algorithm Of Semi-Delaunay Triangulation Of Points Cloud Scattered On Surface
Computer Science, 2014 The purpose of the paper is to generalize the Delaunay triangulation onto surfaces. A formal definition and appropriate algorithm are presented. Starting from plane domain Delaunay triangulation definition a theoretical approach is evolved which is a ...
Jan Kucwaj
doaj +1 more source
On deletion in Delaunay triangulations [PDF]
Proceedings of the fifteenth annual symposium on Computational geometry, 1999 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 number only applies to low cost operations, while time consuming computations are only done a linear ...
openaire +5 more sources
Improved Routing on the Delaunay Triangulation
Discrete & Computational Geometry, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicolas Bonichon +5 more
openaire +4 more sources