Combinatorial maps. Efficient data structures for computer graphics and image processing
From MaRDI portal
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 3988693 (Why is no real title available?)
- Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps
- Preserving consistency in geometric modeling with graph transformations
- Parallel homological calculus for 3D binary digital images
- Homology of cellular structures allowing multi-incidence
- Implicit encoding and simplification/reduction of nGmaps
- Parallel homology computation of meshes
- Tubular parametric volume objects: thickening a piecewise smooth 3D stick figure
- Simploidal sets: a data structure for handling simploidal Bézier spaces
- Distributed combinatorial maps for parallel mesh processing
- The design and implementation of panar maps in CGAL
- Computing the overlaps of two maps
- Homology computation during an incremental construction process
- Combinatorial maps for 2D and 3D image segmentation
- Efficient implementation of 3D FEM for nonlocal Poisson problem with different ball approximation strategies
- Local computation of homology variations over a construction process
- Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore
This page was built for publication: Combinatorial maps. Efficient data structures for computer graphics and image processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175455)
