Results 61 to 70 of about 681,623 (204)
A complete solution of cartographic displacement based on elastic beams model and Delaunay triangulation [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2014 In map production and generalization, it is inevitable to arise some spatial conflicts, but the detection and resolution of these spatial conflicts still requires manual operation.
Y. Liu, Q. Guo, Y. Sun
doaj +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
Constrained Delaunay triangulation for multiresolution surface description
, 1988 The problem of building a constrained Delaunay triangulation (CDT) at different levels of resolution is considered for the hierarchical description of topographic surfaces. The surface is approximated at each level by a network of planar triangular faces
Puppo Enrico, De Floriani Leila
core +1 more source
Frontiers in Plant Science, 2018 This paper introduces a novel hierarchical structured representation for leaf modeling and proposes a corresponding multi-resolution remeshing method for large-scale visual computation. Leaf modeling is a very difficult and challenging problem due to the
Weiliang Wen +5 more
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
Annals of the Academy of Romanian Scientists Series on Mathematics and Its Application, 2020 "In this paper we present an edge swapping approach for incorporating line segments into triangulation. If the initial triangulation is Delaunay, the algorithm tends to produce optimal Constrained Delaunay triangulation by improving the triangles’ aspect ratios from the local area being constrained.
Bozhidar Angelov Stanchev +1 more
openaire +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
ComputationWe propose a method for establishing a Constrained Delaunay Triangulation CDT applied to 2D binary images of high morphological complexity. A prerequisite for CDT is the unbiased definition of the Planar Straight-Line Graph PSLG, which must respect the ...
Franck N’Guyen +2 more
doaj +1 more source
Indoor 3D Route Modeling Based On Estate Spatial Data [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2014 Indoor three-dimensional route model is essential for space intelligence navigation and emergency evacuation. This paper is motivated by the need of constructing indoor route model automatically and as far as possible.
H. Zhang, Y. Wen, J. Jiang, W. Huang
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