Results 31 to 40 of about 7,016 (227)
Toughness and Delaunay triangulations [PDF]
Proceedings of the third annual symposium on Computational geometry - SCG '87, 1987 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +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 PARALLELED DELAUNAY TRIANGULATION ALGORITHM FOR PROCESSING LARGE LIDAR POINTS [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2022 LiDAR is an important data source for disaster prevention and mitigation, its advantages include speediness, penetration, initiative, high-density and high-precision, high efficiency, information-richness.
Y. Song, M. Li, M. Li, X. Liu
doaj +1 more source
Curved optimal delaunay triangulation [PDF]
ACM Transactions on Graphics, 2018 Meshes with curvilinear elements hold the appealing promise of enhanced geometric flexibility and higher-order numerical accuracy compared to their commonly-used straight-edge counterparts. However, the generation of curved meshes remains a computationally expensive endeavor with current meshing approaches: high-order parametric elements are ...
Feng, Leman +4 more
openaire +3 more sources
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
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
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
Perturbations for Delaunay and weighted Delaunay 3D triangulations
Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Devillers, Olivier, Teillaud, Monique
openaire +3 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