Results 71 to 80 of about 655,112 (194)
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
ComputationWe propose a method for generating a constrained Delaunay triangulation CDT applied to labeled 2D images with high morphological complexity. In the previous paper, Part 1, we established an unbiased planar straight-line graph (PLSG) on image objects of ...
F. N’Guyen, T. Kanit, A. Imad
doaj +1 more source
Strictly Conservative Neural Distance Fields
Computer Graphics Forum, EarlyView.Abstract We propose a first method to generate neural unsigned or signed distance fields (SDFs) that are guaranteed to be conservative with respect to a given 3D shape. This means the true distance is never overestimated and the zero‐level set is a bounding volume for the shape. The method makes use of neural network architectures that ensure Lipschitz
I. Ludwig, M. Campen
wiley +1 more source
A fast algorithm for well-spaced points and approximate delaunay graphs [PDF]
Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13, 2013 We present a new algorithm that produces a well-spaced superset of points conforming to a given input set in any dimension with guaranteed optimal output size. We also provide an approximate Delaunay graph on the output points. Our algorithm runs in expected time $O(2^{O(d)}(n\log n + m))$, where $n$ is the input size, $m$ is the output point set size,
Gary L. Miller +2 more
openaire +4 more sources
3D Building Modelling from ALS Point Clouds by Delaunay Triangulation and Graph Theories [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information SciencesAs an important task in 3D building reconstruction, 3D roof reconstruction attracts increasing attention. Existing methods have the issue of additional errors caused by multi-step processes, resulting in relatively high uncertainty and potentially ...
G. Kong, H. Fan, G. Lobaccaro
doaj +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
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
Sketch of a Delaunay Triangulation.
, 2015 The Delaunay triangulation and its dual, the Voronoi tessellation for a random set of points. The blue lines are the segments of the Voronoi tessellation, the red ones are the edges of the Delaunay graph (triangulation).
Matthias Krufczik (749498) +8 more
core +1 more source
Detail Preserved Surface Reconstruction from Point Cloud
Sensors, 2019 In this paper, we put forward a new method for surface reconstruction from image-based point clouds. In particular, we introduce a new visibility model for each line of sight to preserve scene details without decreasing the noise filtering ability.
Yang Zhou, Shuhan Shen, Zhanyi Hu
doaj +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