Results 31 to 40 of about 26,216 (246)
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.
Hammar, M. +2 more
openaire +4 more sources
Minimal Delaunay Triangulations of Hyperbolic Surfaces [PDF]
Discrete & Computational Geometry, 2022 AbstractMotivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we show that every hyperbolic surface of genus g has a simplicial Delaunay triangulation with O(g) vertices, where edges are given by distance paths.
Matthijs Ebbens +2 more
openaire +5 more sources
A Boundary Construction Algorithm for a Complex Planar Point Set
Complexity, 2021 It is difficult to extract the boundary of complex planar points with nonuniform distribution of point density, concave envelopes, and holes. To solve this problem, an algorithm is proposed in this paper.
Zhenxiu Liao, Guodong Shi
doaj +1 more source
The objective assessment of the image quality based on the geometrical concentration [PDF]
E3S Web of Conferences, 2020 The method of the objective evaluation of the satellite images based on the calculation of the geometrical concentration using triangulation Delaunay is proposed.
Maltsev Evgenii A. +2 more
doaj +1 more source
THE STABILITY OF DELAUNAY TRIANGULATIONS [PDF]
International Journal of Computational Geometry & Applications, 2013 We introduce a parametrized notion of genericity for Delaunay triangulations which, in particular, implies that the Delaunay simplices of δ-generic point sets are thick. Equipped with this notion, we study the stability of Delaunay triangulations under perturbations of the metric and of the vertex positions.
JEAN-DANIEL BOISSONNAT +2 more
openaire +5 more sources
Constrained Construction of Planar Delaunay Triangulations without Flipping
Structural Mechanics of Engineering Constructions and Buildings, 2018 The construction of Voronoi diagrams and Delaunay triangulations finds wide application in many branches of science. Delaunay triangulations have properties which make them more desirable than other triangulations for the same node set.
Vera V Galishnikova, Peter Jan Pahl
doaj +1 more source
Kinetic and Dynamic Delaunay tetrahedralizations in three dimensions [PDF]
, 2003 We describe the implementation of algorithms to construct and maintain three-dimensional dynamic Delaunay triangulations with kinetic vertices using a three-simplex data structure.
Aurenhammer +36 more
core +2 more sources
Exact and heuristic algorithms for Space Information Flow. [PDF]
PLoS ONE, 2018 Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF.
Alfred Uwitonze +4 more
doaj +1 more source
Современные информационные технологии и IT-образование, 2020 The paper considers a method for representing a set of information objects (scenes) in the field of view of an intelligent robot, based on the fuzzy Delaunay triangulation due to locally regular refinement of the original (coarse) triangular mesh using ...
Vladimir Khramov
doaj +1 more source
Delaunay-Triangulation-Based Learning With Hessian Total-Variation Regularization
IEEE Open Journal of Signal Processing, 2023 Regression is one of the core problems tackled in supervised learning. Neural networks with rectified linear units generate continuous and piecewise-linear (CPWL) mappings and are the state-of-the-art approach for solving regression problems.
Mehrsa Pourya +2 more
doaj +1 more source