Results 1 to 10 of about 191,849 (199)
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
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
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
Delaunay triangulation of imprecise points, preprocess and actually get a fast query time
Journal of Computational Geometry, 2011 We propose a new algorithm to preprocess a set of n disjoint unit disks in O(n log n) expected time, allowing to compute the Delaunay triangulation of a set of n points, one from each disk, in O(n) expected time.
Olivier Devillers
doaj +3 more sources
The Stretch Factor of Hexagon-Delaunay Triangulations
Journal of Computational Geometry, 2022 The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in computational geometry. Over the years, a series of upper and lower bounds
Ljubomir Perkovic +2 more
doaj +1 more source
Enviromental data visualisation using Delaunay triangulation
Journal of Computer Sciences Institute, 2020 Graphical data representation is very helpful when analyzing environmental data. It allows for discovering trends in data and analysis of phenomena occurring in the area. There are many possibilities to represent such values graphically.
Mateusz Nowosad
doaj +1 more source
Algorithms, 2022 Detecting the intangible continuous object (ICO) is a significant task, especially when the ICO is harmful as a toxic gas. Many studies used steady sensors to sketch the contour and find the area of the ICO.
Shih-Chang Huang, Cong-Han Huang
doaj +1 more source
Application of Delaunay Triangulation and Catalan Objects in Steganography
Mathematics, 2021 This paper presents a new method of steganography based on a combination of Catalan objects and Voronoi–Delaunay triangulation. Two segments are described within the proposed method.
Faruk Selimović +3 more
doaj +1 more source