Results 91 to 100 of about 7,960 (210)

Parallelized ear clipping for the triangulation and constrained Delaunay triangulation of polygons

Computational Geometry, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eder, Günther, Held, Martin, Palfrader, Peter   +2 more
openaire   +2 more sources

Three-dimensional alpha shapes

, 1994
Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal notion of the
Edelsbrunner, Herbert, Mücke, Ernst
core   +3 more sources

Three-dimensional unstructured grid generation via incremental insertion and local optimization [PDF]

Algorithms for the generation of 3D unstructured surface and volume grids are discussed. These algorithms are based on incremental insertion and local optimization.
Barth, Timothy J., Gandhi, Amar S., Wiltberger, N. Lyn   +2 more
core   +1 more source

Gap Processing for Adaptive Maximal Poisson-Disk Sampling [PDF]

, 2013
In this paper, we study the generation of maximal Poisson-disk sets with varying radii. First, we present a geometric analysis of gaps in such disk sets.
Wonka, Peter, Yan, Dong-Ming
core  

Perceptually Motivated Shape Context Which Uses Shape Interiors

, 2012
In this paper, we identify some of the limitations of current-day shape matching techniques. We provide examples of how contour-based shape matching techniques cannot provide a good match for certain visually similar shapes.
Kakarala, Ramakrishna, Premachandran, Vittal   +1 more
core   +1 more source

Deformation Detection of the Centroid Axes for Beams with Variable Cross-Sections Based on Point Cloud Data

Applied Sciences
Accurate extraction of the centroid axes of beams with variable cross-sections is critical for infrastructure health monitoring. While 3D laser scanning provides dense point clouds, existing methods face challenges due to fixed slicing directions, sparse
Jia Zou, Yang Li, Yaojun Zhou, Xiongyao Xie, Genji Tang, Xiaoming Xu   +5 more
doaj   +1 more source

Parallel constrained Delaunay triangulation

, 2013
In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight line graph consisting of points and segments. The method is based on an incremental insertion, taking special care to avoid conflicts during concurrent insertion of points into the triangulation and concurrent edge flips.
Coll Arnau, Narcís, Guerrieri Basualdo, María Ethel, Díaz Báñez, José Miguel (Coordinador), Garijo Royo, Delia (Coordinador), Márquez Pérez, Alberto (Coordinador), Urrutia Galicia, Jorge (Coordinador)   +5 more
openaire   +2 more sources

Urban Parcel Grouping Method Based on Urban Form and Functional Connectivity Characterisation

ISPRS International Journal of Geo-Information, 2019
The grouping of parcel data based on proximity is a pre-processing step of GIS and a key link of urban structure recognition for regional function discovery and urban planning. Currently, most literature abstracts parcels into points and clusters parcels
Peng Wu, Shuqing Zhang, Huapeng Li, Patricia Dale, Xiaohui Ding, Yuanbing Lu   +5 more
doaj   +1 more source

A Study on Vector-Based Processing and Texture Application Techniques for 3D Object Creation and Visualization

Applied Sciences
This study proposes a technique for generating 3D objects from Shapefile-based 2D spatial data and converting them to comply with the CityGML 3.0 standard.
Donghwi Kang, Jeongyeon Kim, Jongchan Lee, Haeju Lee, Jihyeok Kim, Jungwon Byun   +5 more
doaj   +1 more source

Constant-work-space algorithms for geometric problems

Journal of Computational Geometry, 2011
Constant-work-space algorithms may use only constantly many cells of storage in addition to their input, which is provided as a read-only array.
Tetsuo Asano, Wolfgang Mulzer, Günter Rote, Yajun Wang   +3 more
doaj   +1 more source