Results 11 to 20 of about 456 (184)
Delaunay triangulations of generalized Bolza surfaces
Journal of Computational Geometry, 2022 The Bolza surface can be seen as the quotient of the hyperbolic plane, represented by the Poincar\'e disk model, under the action of the group generated by the hyperbolic isometries identifying opposite sides of a regular octagon centered at the origin.
Matthijs Ebbens +3 more
doaj +1 more source
FAST ROBUST ARITHMETICS FOR GEOMETRIC ALGORITHMS AND APPLICATIONS TO GIS [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2021 Geometric predicates are used in many GIS algorithms, such as the construction of Delaunay Triangulations for Triangulated Irregular Networks (TIN) or geospatial predicates.
T. Bartels, V. Fisikopoulos
doaj +1 more source
Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks
Journal of Computational Geometry, 2020 We study general Delaunay-graphs, which are natural generalizations of Delaunay triangulations to arbitrary families, in particular to pseudo-disks. We prove that for any finite pseudo-disk family and point set, there is a plane drawing of their Delaunay-
Balázs Keszegh, Dömötör Pálvölgyi
doaj +1 more source
JIGSAW-GEO (1.0): locally orthogonal staggered unstructured grid generation for general circulation modelling on the sphere [PDF]
Geoscientific Model Development, 2017 An algorithm for the generation of non-uniform, locally orthogonal staggered unstructured spheroidal grids is described. This technique is designed to generate very high-quality staggered Voronoi–Delaunay meshes appropriate for general circulation ...
D. Engwirda, D. Engwirda
doaj +1 more source
Parallel algorithms for planar and spherical Delaunay construction with an application to centroidal Voronoi tessellations [PDF]
Geoscientific Model Development, 2013 A new algorithm, featuring overlapping domain decompositions, for the parallel construction of Delaunay and Voronoi tessellations is developed. Overlapping allows for the seamless stitching of the partial pieces of the global Delaunay tessellations ...
D. W. Jacobsen +4 more
doaj +1 more source
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
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
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
AUTOMATED PHOTOGRAMMETRIC IMAGE MATCHING WITH SIFT ALGORITHM AND DELAUNAY TRIANGULATION [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 An algorithm for image matching of multi-sensor and multi-temporal satellite images is developed. The method is based on the SIFT feature detector proposed by Lowe in (Lowe, 1999).
G. Karagiannis +2 more
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