Combinatorial maps. Efficient data structures for computer graphics and image processing

DOI10.1201/B17403MaRDI QIDQ5175455zbMATH OpenOpenAlexFDO

Authors Guillaume Damiand, P. Lienhardt

Publication date 23 February 2015

Full work available at URL https://doi.org/10.1201/b17403

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Nonnumerical algorithms (68W05)

Recommendations

• Geometric data structures for computer graphics.
• Combinatorial maps for 2D and 3D image segmentation
• scientific article; zbMATH DE number 4072225
• Digital and discrete geometry. Theory and algorithms
• Geometry of digital spaces

Cited in

(18)

• Simploidal sets: a data structure for handling simploidal Bézier spaces
• Consistently oriented dart-based 3D modelling by means of geometric algebra and combinatorial maps
• Tubular parametric volume objects: thickening a piecewise smooth 3D stick figure
• Local computation of homology variations over a construction process
• Efficient representation of Laguerre mosaics with an application to microstructure simulation of complex ore
• Distributed combinatorial maps for parallel mesh processing
• Homology of cellular structures allowing multi-incidence
• Homology computation during an incremental construction process
• Parallel homology computation of meshes
• Computing the overlaps of two maps
• scientific article; zbMATH DE number 3988693 (Why is no real title available?)
• Combinatorial maps for 2D and 3D image segmentation
• Preserving consistency in geometric modeling with graph transformations
• The design and implementation of panar maps in CGAL
• Parallel homological calculus for 3D binary digital images
• Implicit encoding and simplification/reduction of nGmaps
• Efficient implementation of 3D FEM for nonlocal Poisson problem with different ball approximation strategies
• Formal definition of hexahedral blocking operations using n-G-maps

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)