Results 71 to 80 of about 191,849 (199)
Triangulations with Circular Arcs
Journal of Graph Algorithms and Applications, 2015 An important objective in the choice of a triangulation of a given point set is that the smallest angle becomes as large as possible. When triangulation edges are straight line segments, it is known that the Delaunay triangulation is the optimal solution.
Oswin Aichholzer +5 more
doaj +1 more source
Meshing Unsigned Distance Fields with Regular Triangulations
Computer Graphics Forum, EarlyView.Abstract Unsigned distance fields (UDF) are a versatile, implicit representation of geometry. They can represent surfaces that are not bounding a solid or contain points or curves that are not manifold, for example several sheets meeting along a common curve. Contouring the implicit representation, i.e. turning it into an explicit one, requires finding
M. Kohlbrenner, M. Alexa
wiley +1 more source
Tangent Blow‐Ups for Processing Non‐Manifold Geometry
Computer Graphics Forum, EarlyView.Abstract Many geometry processing pipelines implicitly assume their input data is a manifold, or is sampled from one, with a unique tangent plane at every point. Geometric data, however, routinely contains sharp features like edges, corners, self‐intersections, branching junctions, and other singularities, rendering standard methods ill‐defined at ...
Alice Petrov +3 more
wiley +1 more source
A practical algorithm for weighted k‐hulls
Computer Graphics Forum, EarlyView.Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
Proximal delaunay triangulation regions
, 2015 Peters, James FrancisThis article introduces proximal Delau-nay triangulation regions and strongly near (also called overlap) Delaunay triangles. A main result in this paper is the proof that proximal Delaunay triangulation regions are convex polygons ...
LHCb Collaboration
core
ISPRS International Journal of Geo-Information, 2018 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
SharpEdge: Edge Feature Surface Reconstruction From Space Curves
Computer Graphics Forum, EarlyView.SharpEdge reconstructs surfaces with sharp features from sparse 3D curve networks. By estimating dual normals along curves, our method preserves ridges and corners while producing high‐quality meshes. Abstract Reconstructing high‐quality surfaces from sparse 3D space curves remains challenging, particularly when sharp feature edges are involved ...
X. Yu, A. Sheffer, N. Carr, Y. Gingold
wiley +1 more source
Zero-Watermarking for Vector Maps Combining Spatial and Frequency Domain Based on Constrained Delaunay Triangulation Network and Discrete Fourier Transform. [PDF]
Entropy (Basel), 2023 Xi X, Hua Y, Chen Y, Zhu Q.
europepmc +1 more source
Journal of Regional Science, Volume 65, Issue 2, Page 403-428, March 2025.ABSTRACT The aim of this article is to exploit an innovative spatial econometric approach to map and study the evolving patterns of industrial districts (IDs). The procedure can be classified as a k‐means cluster‐wise regression procedure and is designed to detect homogeneous areas of subcontracting activity.
Jacopo Canello +3 more
wiley +1 more source
Parallelization of Delaunay triangulation [PDF]
, 2019 Diplomska naloga je narejena z namenom pohitritve Delaunayeve triangulacije, ki jo uporablja podjetje KobiLabs d.o.o. V prvem delu diplomske naloge smo na kratko predstavili različne tipe Delaunayeve triangulacije in izpostavili prednosti triangulacije ...
ŽAUCER, SIMON
core