Results 21 to 30 of about 7,016 (227)
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
Splitting a Delaunay Triangulation in Linear Time [PDF]
, 2001 Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster algorithms can be designed.
Olivier Devillers +17 more
core +2 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
Excitable Delaunay Triangulations [PDF]
Kybernetes, 2011 PurposeDelaunay triangulations provide a good alternative to existing approaches of modelling unstructured unconventional computers. Experimental research in novel and emerging computing paradigms and materials shows a great progress in designing laboratory prototypes of spatially extended computing devices. In these devices, computation is implemented
openaire +3 more sources
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
Visual Computing for Industry, Biomedicine, and Art, 2020 This research provides an exploration of a biomimetic approach in the process of designing a candelabra model using linear shaped leaves of a Bell flower. The design process described in this research contains two steps: biological and geometrical.
Biljana S. Jović, Anđela D. Mitić
doaj +1 more source
Good triangulations yield good tours [PDF]
, 2008 Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph. In this paper, we give
Pearson, N +3 more
core +1 more source
Outerplanar Graphs and Delaunay Triangulations [PDF]
, 2012 Dillencourt [1] showed that all maximal outerplanar graphs can be realized as Delaunay triangulations of points in convex position. In this note, we give two new, alternate proofs.
Alam, Ashraful +2 more
openaire +2 more sources