Combinatorial Maps

Efficient Data Structures for Computer Graphics and Image Processing

By: Guillaume Damiand, Pascal Lienhardt

Write A Review

eText | 19 September 2014 | Edition Number 1

At a Glance

Format
ePUB

eText

$129.80

or 4 interest-free payments of $32.45 with

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

A Versatile Framework for Handling Subdivided Geometric ObjectsCombinatorial 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 an