1st Edition

Combinatorial Maps Efficient Data Structures for Computer Graphics and Image Processing

By Guillaume Damiand, Pascal Lienhardt Copyright 2015
    404 Pages
    by A K Peters/CRC Press

    406 Pages
    by A K Peters/CRC Press

    A Versatile Framework for Handling Subdivided Geometric Objects

    Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing gathers important ideas related to combinatorial maps and explains how the maps are applied in geometric modeling and image processing. It focuses on two subclasses of combinatorial maps: n-Gmaps and n-maps.

    Suitable for researchers and graduate students in geometric modeling, computational and discrete geometry, computer graphics, and image processing and analysis, the book presents the data structures, operations, and algorithms that are useful in handling subdivided geometric objects. It shows how to study data structures for the explicit representation of subdivided geometric objects and describes operations for handling the structures. The book also illustrates results of the design of data structures and operations.

    Introduction. Preliminary Notions. Intuitive Presentation. n-Gmaps. n-maps. Operations. Embedding for Geometric Modeling and Image Processing. Cellular Structures as Structured Simplicial Structures. Comparison with Other Cellular Data Structures. Concluding Remarks. Bibliography. Index.


    Damiand, Guillaume; Lienhardt, Pascal