• Login
    View Item 
    •   DSpace Home
    • English resources
    • Technology
    • View Item
    •   DSpace Home
    • English resources
    • Technology
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Combinatorial maps efficient data structures for computer graphics and image processing

    Thumbnail
    View/Open
    5_Combinatorial_Maps_Efficient_Data_Structures_for_Computer_Graphics.pdf (117.0Mb)
    Date
    2014
    Author
    Damiand, Guillaume
    Lienhardt, Pascal
    Metadata
    Show full item record
    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
    Collections
    • Technology [3206]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsBy Submit DateThis CollectionBy Issue DateAuthorsTitlesSubjectsBy Submit Date

    My Account

    LoginRegister

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV