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.

About the Author
Damiand, Guillaume; Lienhardt, Pascal

Reviews
"An excellent technical teaching tool, especially recommended for college library mathematics and computer science shelves." -Midwest Book Review, January 2015 "Guillaume Damiand and Pascal Lienhardt have produced an excellent book that discusses in full details a family of data structures for representing explicitly the connectivity of low-dimensional meshes, such as those used for some image and terrain processing or for modeling and animating geometric shapes. ... it provides a mathematically rigorous introduction to this area of research and gives the attentive reader a deep understanding of n-Gmaps and n-Maps, both as theoretical models and as practical data structures and associated operators." -Jarek Rossignac, Georgia Institute of Technology



Book Information
ISBN 9781482206524
Author Guillaume Damiand
Format Hardback
Page Count 406
Imprint Apple Academic Press Inc.
Publisher Apple Academic Press Inc.
Weight(grams) 706g