| Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing Contributor(s): Damiand, Guillaume (Author), Lienhardt, Pascal (Author) |
|
 |
ISBN: 1482206528 ISBN-13: 9781482206524 Publisher: A K PETERS OUR PRICE: $161.50 Product Type: Hardcover - Other Formats Published: September 2014 |
| Additional Information |
| BISAC Categories: - Computers | Computer Graphics - Technology & Engineering | Imaging Systems - Computers | Programming - Games |
| Dewey: 005.741 |
| LCCN: 2014024219 |
| Physical Information: 1" H x 6.1" W x 9.2" (1.55 lbs) 406 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: 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. |