Please use this identifier to cite or link to this item: http://lib.hpu.edu.vn/handle/123456789/21158
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDamiand, Guillaumeen_US
dc.contributor.authorLienhardt, Pascalen_US
dc.date.accessioned2016-06-10T08:32:12Z
dc.date.available2016-06-10T08:32:12Z
dc.date.issued2014en_US
dc.identifier.isbn978-1482206524en_US
dc.identifier.otherHPU1160107en_US
dc.identifier.urihttps://lib.hpu.edu.vn/handle/123456789/21158-
dc.description.abstractCombinatorial 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.extent377 p.en_US
dc.format.mimetypeapplication/pdf-
dc.language.isoenen_US
dc.publisherTaylor and Francis Groupen_US
dc.subjectCombinatorial mapsen_US
dc.subjectData structuresen_US
dc.subjectComputer graphicsen_US
dc.subjectImage processingen_US
dc.titleCombinatorial maps efficient data structures for computer graphics and image processingen_US
dc.typeBooken_US
dc.size1119,847KBen_US
dc.departmentEnglish resourcesen_US
Appears in Collections:Technology

Files in This Item:
File Description SizeFormat 
5_Combinatorial_Maps_Efficient_Data_Structures_for_Computer_Graphics.pdf
  Restricted Access
119.85 MBAdobe PDFThumbnail
View/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.