|
![]() |
|||
|
||||
OverviewA 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. Full Product DetailsAuthor: Guillaume Damiand (CNRS/Universite de Lyon, Villeurbanne Cedex, France) , Pascal Lienhardt (University of Poitiers, Futuroscope Chasseneuil Cedex, France)Publisher: CRC Press Imprint: CRC Press ISBN: 9781322634159ISBN 10: 1322634157 Pages: 402 Publication Date: 01 January 2014 Audience: General/trade , General Format: Electronic book text Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |