Please use this identifier to cite or link to this item:
http://lib.hpu.edu.vn/handle/123456789/21195
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Damiand, Guillaume | en_US |
dc.contributor.author | Lienhardt, Pascal | en_US |
dc.date.accessioned | 2016-06-10T08:32:30Z | |
dc.date.available | 2016-06-10T08:32:30Z | |
dc.date.issued | 2015 | en_US |
dc.identifier.isbn | 978-1-4822-0653-1 | en_US |
dc.identifier.other | HPU1160020 | en_US |
dc.identifier.uri | https://lib.hpu.edu.vn/handle/123456789/21195 | - |
dc.description.abstract | Although they are less widely known than other models, combinatorial maps are very powerful data structures and can be useful in many applications, including computer graphics and image processing. The book introduces these data structures, describes algorithms and data structures associated with them, makes connections to other common structures, and demonstrates how to use these structures in geometric modeling and image processing. The data structures and algorithms introduced in the book will be available in a C++ library on the authors' website. | en_US |
dc.format.extent | 402 p. | en_US |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | en_US |
dc.publisher | CRC Press | en_US |
dc.subject | Combinatorial maps | en_US |
dc.subject | Image processing | en_US |
dc.subject | Computers graphics | en_US |
dc.title | Combinatorial maps. Efficient data structures for comp, graphics and image processing | en_US |
dc.type | Book | en_US |
dc.size | 119,842KB | en_US |
dc.department | English resources | en_US |
Appears in Collections: | Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
7_Combinatorialmaps_efficientdatastructures.pdf Restricted Access | 119.84 MB | Adobe PDF | ![]() View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.