Results 21 to 30 of about 191,849 (199)
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 +6 more sources
Delaunay triangulation based image enhancement for echocardiography images [PDF]
, 2009 A novel image enhancement approach for automatic echocardiography image processing is proposed. The main steps include undecimated wavelet based speckle noise reduction, edge detection, followed by a regional enhancement process that employs Delaunay ...
Ahanathapillai, V. +2 more
core +3 more sources
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
Formal study of plane Delaunay triangulation [PDF]
, 2010 International audienceThis article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved.
Yves Bertot +3 more
core +7 more sources
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
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
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
Implementing Data-Dependent Triangulations with Higher Order Delaunay Triangulations
ISPRS International Journal of Geo-Information, 2017 The Delaunay triangulation is the standard choice for building triangulated irregular networks (TINs) to represent terrain surfaces. However, the Delaunay triangulation is based only on the 2D coordinates of the data points, ignoring their elevation ...
Natalia Rodríguez, Rodrigo I. Silveira
doaj +1 more source
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
Distributed Kinetic Delaunay triangulation [PDF]
, 2005 This paper proposes a distributed algorithm to maintain the Delaunay triangulation of moving points. We assume that every point is a processor which can only communicate with the adjacent points connected by edges in the Delaunay triangulation.
유태원 +3 more
core +1 more source