Results 91 to 100 of about 7,016 (227)
Harmonic deformation of the Delaunay triangulation
Dado um processo de Poisson d-dimensional, construímos funções harmônicas na triangulação de Delaunay associada, com comportamento assintótico linear, como limite de um processo de harness sem ruído. Tais funções permitem que construamos uma nova imersão
Rafael de Mattos Grisi +1 more
core +1 more source
Delaunay triangulation programs on surface data. [PDF]
The Delaunay triangulation of a set of points in 3D can have size Θ(n2) in the worst case, but this is rarely if ever observed in practice. We compare three production-quality Delaunay triangulation programs on some 'real-world' sets of points lying on ...
Choi, Sunghee, Amenta, Nina
core +2 more sources
Extracting the split line of narrow and long patches is important for the generalization of land-use thematic data. There are two commonly used methods for extracting the split lines: One is based on Delaunay triangulation and the other is based on ...
Chengming Li +4 more
doaj +1 more source
Survey on differential estimators for 3d point clouds
Abstract Recent advancements in 3D scanning technologies, including LiDAR and photogrammetry, have enabled the precise digital replication of real‐world objects. These methods are widely used in fields such as GIS, robotics, and cultural heritage. However, the point clouds generated by such scans are often noisy and unstructured, posing challenges for ...
Léo Arnal–Anger +4 more
wiley +1 more source
WALKING - BASED DELAUNAY TRIANGULATION
V diplomskem delu najprej opravimo kratek pregled različnih pristopov za tvorjenje Delaunayeve triangulacije, nato pa se osredotočimo na algoritem gradnje triangulacije s korakanjem.
Pevec, Amadej
core +1 more source
Parallel constrained Delaunay triangulation [PDF]
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight line graph consisting of points and segments. The method is based on an incremental insertion, taking special care to avoid conflicts
Coll Arnau, Narcís +5 more
core
Quantitative Metrics for Edge Bundling of Network Visualizations
Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source
A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded
Abstract Grid maps – spatially arranged small multiples – are a powerful tool to show complex geospatial data. Meulemans et al. (2020) introduced a pipeline for computing high‐quality grid maps that are shaped roughly according to their containing geographic outlines.
W. Meulemans
wiley +1 more source
Technology of 3d relief modelling based on Delaunay triangulation algorithms
This paper represents the algorithm of superimposing underwater relief and land relief basing on heterogeneous initial data with the use of Delaunay triangulation. As a result of superimposition a qualitative 3D relief model has been created.
Andrey Gachenko, Alexey Khmelnov
doaj +1 more source
The Pinnated Bittern Botaurus pinnatus (Ardeidae) is a widely distributed Neotropical wading bird whose distribution and seasonal status remain poorly resolved. Discrepancies among published literature, citizen science records and the range currently assumed by BirdLife International indicate that both its geographical distribution and migratory ...
Helon Simões Oliveira +3 more
wiley +1 more source

