Please use this identifier to cite or link to this item:
https://lib.hpu.edu.vn/handle/123456789/21158
Title: | Combinatorial maps efficient data structures for computer graphics and image processing |
Authors: | Damiand, Guillaume Lienhardt, Pascal |
Keywords: | Combinatorial maps Data structures Computer graphics Image processing |
Issue Date: | 2014 |
Publisher: | Taylor and Francis Group |
Abstract: | 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. mirknig.com 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. |
URI: | https://lib.hpu.edu.vn/handle/123456789/21158 |
ISBN: | 978-1482206524 |
Appears in Collections: | Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
5_Combinatorial_Maps_Efficient_Data_Structures_for_Computer_Graphics.pdf Restricted Access | 119.85 MB | Adobe PDF | ![]() View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.