Results 41 to 50 of about 681,623 (204)
SF-Recon: Simplification-Free Lightweight Building Reconstruction via 3D Gaussian Splatting [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information SciencesLightweight building surface models are crucial for digital city, navigation, and fast geospatial analytics, yet conventional multi-view geometry pipelines remain cumbersome and quality-sensitive due to their reliance on dense reconstruction, meshing ...
Z. Li +5 more
doaj +1 more source
Fast segment insertion and incremental construction of constrained Delaunay triangulations [PDF]
Computational Geometry, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jonathan Richard Shewchuk +1 more
openaire +3 more sources
Controllable Intrinsic Surface Pattern Generation Using Slime Mold Simulations
Computer Graphics Forum, EarlyView.Abstract Surface‐based pattern simulations have proven valuable for texture design and scientific visualization, but existing methods face several limitations. Most simulations either target a narrow range of pattern types (e.g. spots, branching) or support a broad range of patterns at the cost of time‐consuming parameter tuning.
Jeffrey Layton +2 more
wiley +1 more source
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Terminal Triangles Centroid Algorithms for Quality Delaunay Triangulation [PDF]
, 2020 Two Lepp algorithms for quality Delaunay triangulation are discussed. Firstly a terminal triangles centroid Delaunay algorithm is studied. For each bad quality triangle t, the algorithm uses the longest edge propagating path (Lepp(t)) to find a couple of
Rivara Zúñiga, María Cecilia +1 more
core +1 more source
Structured Bitmap-to-Mesh triangulation for geometry-aware discretization of image-derived domains
Graphical ModelsWe introduce a template-driven triangulation framework for embedding discrete boundaries into a regular triangular grid, enabling raster- or segmentation-derived domains to support structure-preserving, numerically stable PDE discretization.
Wei Feng, Haiyong Zheng
doaj +1 more source
A Framework for Discovering Evolving Domain Related Spatio-Temporal Patterns in Twitter
ISPRS International Journal of Geo-Information, 2016 In massive Twitter datasets, tweets deriving from different domains, e.g., civil unrest, can be extracted to constitute spatio-temporal Twitter events for spatio-temporal distribution pattern detection.
Yan Shi +5 more
doaj +1 more source
Fully Dynamic Constrained Delaunay Triangulations [PDF]
, 2004 We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line.
Kallmann, M, Bieri, H, Thalmann, D
openaire +1 more source
Graph‐based Black and White Stylization
Computer Graphics Forum, EarlyView.Abstract Stippling is an art style forming images from large numbers of small dots. Computer graphics practitioners have proposed numerous algorithms for stippling and stippling variants over the years. In this paper, we propose a black and white image stylization technique in which the image is formed from heterogeneous black and white vector marks ...
Ali Sattari Javid +2 more
wiley +1 more source
Geometry-guided adaptive optimization of Delaunay meshes via deep reinforcement learning
Theoretical and Applied Mechanics LettersFinite element analysis (FEA) faces significant challenges in maintaining mesh quality for unstructured Delaunay meshes with complex geometric features, whereas conventional optimization methods often encounter low-quality local optima.
Xixi Shi +7 more
doaj +1 more source