Results 41 to 50 of about 26,216 (246)
Delaunay triangulation of imprecise points, preprocess and actually get a fast query time
Journal of Computational Geometry, 2011 We propose a new algorithm to preprocess a set of n disjoint unit disks in O(n log n) expected time, allowing to compute the Delaunay triangulation of a set of n points, one from each disk, in O(n) expected time.
Olivier Devillers
doaj +1 more source
The study of local terrain modeling methods for vertical planning of the territory [PDF]
Geodesy and Cartography, 2021 This work aims to study the vertical planning method for the terrain area as part of the process of construction geodetic support. Such planning will be carried out based on the aerial survey data from UAVs, which allow the creation of a high-quality ...
Ihor Trevoho +4 more
doaj +1 more source
Efficient moving point handling for incremental 3D manifold reconstruction [PDF]
, 2015 As incremental Structure from Motion algorithms become effective, a good sparse point cloud representing the map of the scene becomes available frame-by-frame.
Matteucci, Matteo, Romanoni, Andrea
core +2 more sources
, 2012 We show that Delaunay triangulations and compressed quadtrees are equivalent structures. More precisely, we give two algorithms: the first computes a compressed quadtree for a planar point set, given the Delaunay triangulation; the second finds the ...
Löffler, Maarten, Mulzer, Wolfgang
core +3 more sources
IEEE AccessDelaunay triangulation is an effective way to build a triangulation of a cloud of points, i.e., a partitioning of the points into simplices (triangles in 2D, tetrahedra in 3D, and so on), such that no two simplices overlap and every point in the set is a
Yahia S. Elshakhs +4 more
doaj +1 more source
Accurate surface normal representation to facilitate gradient coil optimization on curved surface
Magnetic Resonance Letters, 2023 The design methods for gradient coils are mostly based on discrete extrinsic methods (e.g., the Biot–Savart integration calculation), for which the surface normal vector strongly influences any numerical calculation of the discretized surface.
Hao Ren +4 more
doaj +1 more source
Computation of protein geometry and its applications: Packing and function prediction
, 2006 This chapter discusses geometric models of biomolecules and geometric constructs, including the union of ball model, the weigthed Voronoi diagram, the weighted Delaunay triangulation, and the alpha shapes.
A. Bondi +58 more
core +1 more source
On the Optimality of Functionals over Triangulations of Delaunay Sets [PDF]
, 2012 In this short paper, we consider the functional density on sets of uniformly bounded triangulations with fixed sets of vertices. We prove that if a functional attains its minimum on the Delaunay triangulation, for every finite set in the plane, then for ...
Dolbilin, Nikolay P. +2 more
core +4 more sources
Discretized Riemannian Delaunay Triangulations
Procedia Engineering, 2016 AbstractAnisotropic meshes are desirable for various applications, such as the numerical solving of partial differential equations and graph- ics. In this paper, we introduce an algorithm to compute discrete approximations of Riemannian Voronoi diagrams on 2-manifolds.
Rouxel-Labbé, Mael +2 more
openaire +3 more sources
, 2015 Let $P$ be a set of $n$ points in $\mathrm{R}^2$, and let $\mathrm{DT}(P)$ denote its Euclidean Delaunay triangulation. We introduce the notion of an edge of $\mathrm{DT}(P)$ being {\it stable}. Defined in terms of a parameter $\alpha>0$, a Delaunay edge
Agarwal, Pankaj K. +5 more
core +1 more source