bokomslag Combinatorial Maps
Data & IT

Combinatorial Maps

Guillaume Damiand Pascal Lienhardt

Pocket

1199:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 10-16 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

Andra format:

  • 404 sidor
  • 2019
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.
  • Författare: Guillaume Damiand, Pascal Lienhardt
  • Format: Pocket/Paperback
  • ISBN: 9780367378356
  • Språk: Engelska
  • Antal sidor: 404
  • Utgivningsdatum: 2019-10-23
  • Förlag: CRC Press