OpenVolumeMesh–A versatile index-based data structure for 3D polytopal complexes
We present a data structure which is able to represent heterogeneous 3-dimensional
polytopal cell complexes and is general enough to also represent non-manifolds without …
polytopal cell complexes and is general enough to also represent non-manifolds without …
SQuad: Compact representation for triangle meshes
The SQuad data structure represents the connectivity of a triangle mesh by its “S table” of
about 2 rpt (integer references per triangle). Yet it allows for a simple implementation of …
about 2 rpt (integer references per triangle). Yet it allows for a simple implementation of …
Interactive volume visualization of general polyhedral grids
This paper presents a novel framework for visualizing volumetric data specified on complex
polyhedral grids, without the need to perform any kind of a priori tetrahedralization. These …
polyhedral grids, without the need to perform any kind of a priori tetrahedralization. These …
SOT compact representation for tetrahedral meshes
The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient
representation of triangle meshes, storing 6 integer references per triangle (3 vertex …
representation of triangle meshes, storing 6 integer references per triangle (3 vertex …
IA*: An adjacency-based representation for non-manifold simplicial shapes in arbitrary dimensions
We propose a compact, dimension-independent data structure for manifold, non-manifold
and non-regular simplicial complexes, that we call the Generalized Indexed Data Structure …
and non-regular simplicial complexes, that we call the Generalized Indexed Data Structure …
Ternary sparse matrix representation for volumetric mesh subdivision and processing on GPUs
In this paper, we present a novel volumetric mesh representation suited for parallel
computing on modern GPU architectures. The data structure is based on a compact, ternary …
computing on modern GPU architectures. The data structure is based on a compact, ternary …
A minimalistic approach for fast computation of geodesic distances on triangular meshes
The computation of geodesic distances is an important research topic in Geometry
Processing and 3D Shape Analysis as it is a basic component of many methods used in …
Processing and 3D Shape Analysis as it is a basic component of many methods used in …
A dimension-independent data structure for simplicial complexes
We consider here the problem of representing non-manifold shapes discretized as d-
dimensional simplicial Euclidean complexes. To this aim, we propose a dimension …
dimensional simplicial Euclidean complexes. To this aim, we propose a dimension …
Visual analytics using heterogeneous urban data
Several cities contain informal settlements in high-risk areas, particularly mountainous
regions. With growing concerns around climate change, these areas are more susceptible to …
regions. With growing concerns around climate change, these areas are more susceptible to …
Modeling and manipulating cell complexes in two, three and higher dimensions
L Čomić, L De Floriani - Digital Geometry Algorithms: Theoretical …, 2012 - Springer
Cell complexes have been used in geometric and solid modeling as a discretization of the
boundary of 3D shapes. Also, operators for manipulating 3D shapes have been proposed …
boundary of 3D shapes. Also, operators for manipulating 3D shapes have been proposed …