Combinatorial Maps

Regular price €179.80
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Guillaume Damiand
A01=Pascal Lienhardt
Abstract Simplicial Complexes
advanced geometric data structures
algebraic topology applications
Author_Guillaume Damiand
Author_Pascal Lienhardt
Category=UNA
cellular decomposition
Combinatorial Maps
Computational Geometry
Computer Graphics
Connected Component
Data Structures
Discrete Geometry
Efficient Data Structures
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Free Marks
Geometric Modeling
image segmentation methods
Incidence Graphs
Isolated Vertices
Klein Bottle
mesh representation algorithms
Orientability Factor
Orientable Surface
Oriented Edge
Partial Permutation
Polygonal Curve
Reserved Mark
Sew Operations
surface reconstruction
topological data analysis
Topological Map
V2 V3 V4
Vertices Incident
Vertices V1
Winged Edge Data Structure

Product details

  • ISBN 9781482206524
  • Weight: 706g
  • Dimensions: 156 x 234mm
  • Publication Date: 19 Sep 2014
  • Publisher: Apple Academic Press Inc.
  • Publication City/Country: CA
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

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.

Damiand, Guillaume; Lienhardt, Pascal

More from this author