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

Damiand, Guillaume/ Lienhardt, Pascal

ISBN 10: 1482206528 / ISBN 13: 9781482206524

Editore: A K Peters Ltd, 2014

Riguardo questo articolo

383 pages. 8.00x5.00x1.00 inches. In Stock.

Codice articolo x-1482206528

Dati bibliografici

• Titolo: Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing
• Editore: A K Peters Ltd
• Data di pubblicazione: 2014
• Lingua: Inglese
• ISBN 10: 1482206528
• ISBN 13: 9781482206524
• Rilegatura: Hardcover
• Condizione: Brand New
• Peso: 0,71 chilogrammi

Descrizione articolo

Riassunto

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.

Informazioni sull?autore

Damiand, Guillaume; Lienhardt, Pascal