Combinatorial maps efficient data structures for computer graphics and image processing
dc.contributor.author | Damiand, Guillaume | en_US |
dc.contributor.author | Lienhardt, Pascal | en_US |
dc.date.accessioned | 2016-06-10T08:32:12Z | |
dc.date.available | 2016-06-10T08:32:12Z | |
dc.date.issued | 2014 | en_US |
dc.identifier.isbn | 978-1482206524 | en_US |
dc.identifier.other | HPU1160107 | en_US |
dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/21158 | |
dc.description.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. | en_US |
dc.format.extent | 377 p. | en_US |
dc.format.mimetype | application/pdf | |
dc.language.iso | en | en_US |
dc.publisher | Taylor and Francis Group | en_US |
dc.subject | Combinatorial maps | en_US |
dc.subject | Data structures | en_US |
dc.subject | Computer graphics | en_US |
dc.subject | Image processing | en_US |
dc.title | Combinatorial maps efficient data structures for computer graphics and image processing | en_US |
dc.type | Book | en_US |
dc.size | 1119,847KB | en_US |
dc.department | English resources | en_US |
Files in this item
This item appears in the following Collection(s)
-
Technology [3030]