Results 51 to 60 of about 681,623 (204)
Continuous Scale Transformations of Linear Features Using Simulated Annealing-Based Morphing
ISPRS International Journal of Geo-Information, 2017 This paper presents a new method for use in performing continuous scale transformations of linear features using Simulated Annealing-Based Morphing (SABM).
Jingzhong Li +3 more
doaj +1 more source
A novel geometry image to accurately represent a surface by preserving mesh topology
Scientific Reports, 2021 Geometry images parameterise a mesh with a square domain and store the information in a single chart. A one-to-one correspondence between the 2D plane and the 3D model is convenient for processing 3D models.
Sheng Zeng +3 more
doaj +1 more source
Terrain Synthesis and Authoring based on Iso‐Contours
Computer Graphics Forum, EarlyView.Abstract Digital terrains are central to realistic landscape depiction, yet authoring tools must balance perceptual realism with intuitive artistic control. We propose a compact vector‐based representation that models terrain as nested iso‐contours, inspired by geomorphology and cartography.
B. Huftier +5 more
wiley +1 more source
Survey on differential estimators for 3d point clouds
Computer Graphics Forum, EarlyView.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
ISPRS International Journal of Geo-InformationBuilding clustering is a key challenge in cartographic generalization, where the goal is to group spatially related buildings into semantically coherent clusters while preserving the true distribution patterns of urban structures.
Xincheng Yang, Xukang Xie, Dingming Liu
doaj +1 more source
I/O-Efficient Construction of Constrained Delaunay Triangulations [PDF]
, 2005 In this paper, we designed and implemented an I/O-efficient algorithm for constructing constrained Delaunay triangulations. If the number of constraining segments is smaller than the memory size, our algorithm runs in expected $O(\frac{N}{B}{\rm log}_{M/B}\frac{N}{B})$ I/Os for triangulating N points in the plane, where M is the memory size and B is ...
Agarwal, Pankaj Kumar +2 more
openaire +2 more sources
A Simple Grid‐Maps Pipeline: Restructured, Accelerated and Upgraded
Computer Graphics Forum, EarlyView.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
Multi-scale data storage schemes for spatial information systems [PDF]
, 2012 This thesis documents a research project that has led to the design and prototype implementation of several data storage schemes suited to the efficient multi-scale representation of integrated spatial data.
Ware, John Mark
core
On Bending in the As‐Rigid‐As‐Possible Deformation Energy
Computer Graphics Forum, EarlyView.Abstract The well‐established As‐Rigid‐As‐Possible (ARAP) energy has various forms. For surface deformation, commonly used energies contain an implicit bending penalty. We present a natural, continuous generalization that incorporates multiple ARAP versions with an implicit, user‐controllable bending penalty.
Ugo Finnendahl, Marc Alexa
wiley +1 more source
Skeleton Line Extraction Method in Areas with Dense Junctions Considering Stroke Features
ISPRS International Journal of Geo-Information, 2019 Extraction of the skeleton line of complex polygons is difficult, and a hot topic in map generalization study. Due to the irregularity and complexity of junctions, it is difficult for traditional methods to maintain main structure and extension ...
Chengming Li +3 more
doaj +1 more source