Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing

Guillaume Damiand, Pascal Lienhardt

September 19, 2014 by A K Peters/CRC Press
Reference - 404 Pages - 223 B/W Illustrations
ISBN 9781482206524 - CAT# K21513

USD$99.95

Add to Wish List
FREE Standard Shipping!

Features

  • Discusses the application of combinatorial maps in computer graphics and image processing
  • Introduces basic topological and mathematical concepts
  • Shows how to deduce formal models for representing the structures of the objects
  • Explains how to construct n-Gmaps and n-maps
  • Describes the operations for handling n-Gmaps and n-maps
  • Presents cellular objects as simplicial objects structured into cells
  • Compares n-Gmaps, n-maps, and several ordered models for representing quasi-manifolds

Summary

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.