Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing
Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing
复制标题
DOI：
10.1201/b17403
复制
发表时间：
2014-09
期刊：
影响因子：
--
通讯作者：
G. Damiand;P. Lienhardt
中科院分区：
文献类型：
--
作者：
G. Damiand;P. Lienhardt
一个处理细分几何对象的通用框架组合映射：计算机图形和图像处理的高效数据结构收集了与组合映射相关的重要思想，并解释了映射如何应用于几何建模和图像处理。它集中在两个子类的组合映射：n-Gmaps和n-maps。适用于研究人员和研究生在几何建模，计算和离散几何，计算机图形学，图像处理和分析，这本书介绍了数据结构，操作和算法，是有用的处理细分几何对象。它展示了如何研究细分几何对象的显式表示的数据结构，并描述了处理结构的操作。这本书还说明了数据结构和操作的设计结果。
A 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.