null
Loading... Please wait...
FREE SHIPPING on All Unbranded Items LEARN MORE
Print This Page

Combinatorial Maps (Efficient Data Structures for Computer Graphics and Image Processing)

List Price: $91.99
SKU:
9780367378356
Quantity:
Minimum Purchase
25 unit(s)
  • Availability: Confirm prior to ordering
  • Branding: minimum 50 pieces (add’l costs below)
  • Check Freight Rates (branded products only)

Branding Options (v), Availability & Lead Times

  • 1-Color Imprint: $2.00 ea.
  • Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
  • Belly-Band Wrap: $2.50 ea. (full-color printed)
  • Set-Up Charge: $45 per decoration
FULL DETAILS
  • Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
  • Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
  • Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
  • RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
  • Product Details

    Author:
    Guillaume Damiand, Pascal Lienhardt
    Format:
    Paperback
    Pages:
    404
    Publisher:
    CRC Press (October 23, 2019)
    Language:
    English
    ISBN-13:
    9780367378356
    Weight:
    28oz
    Dimensions:
    6.125" x 9.1875"
    File:
    TAYLORFRANCIS-TayFran_260825151031473-20260825.xml
    Folder:
    TAYLORFRANCIS
    List Price:
    $91.99
    Case Pack:
    18
    As low as:
    $87.39
    Publisher Identifier:
    P-CRC
    Discount Code:
    H
    Audience:
    Professional and scholarly
    Country of Origin:
    United States
    Pub Discount:
    30
    Imprint:
    A K Peters/CRC Press
  • Overview

    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.