Perceptual organization and the representation of natural form
Artificial Intelligence
Surface Coding Based on Morse Theory
IEEE Computer Graphics and Applications
Constructing a Reeb graph automatically from cross sections
IEEE Computer Graphics and Applications
Invited Lecture: A Shape Abstraction Paradigm for Modeling Geometry and Semantics
CGI '98 Proceedings of the Computer Graphics International 1998
Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Topological Reconstruction of Occluded Objects in Video Sequences
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Complex Fiedler Vectors for Shape Retrieval
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph-based representations of point clouds
Graphical Models
Computer Graphics Forum
| Hi-index | 0.00 |
The aim of this paper is to describe a conceptual model for surface representation based on topological coding, which defines a sketch of a surface usable for classification or compression purposes. Theoretical approaches based on differential topology and geometry have been used for surface coding, for example Morse theory and Reeb graphs. To use these approaches in discrete geometry, it is necessary to adapt concepts developed for smooth manifolds to discrete surface models, as for example piecewise linear approximations. A typical problem is represented by degenerate critical points, that is non-isolated critical points such as plateaux and flat areas of the surface. Methods proposed in literature either do not consider the problem or propose local adjustments of the surface, which solve the theoretical problem but may lead to a wrong interpretation of the shape by introducing artefacts, which do not correspond to any shape feature. In this paper, an Extended Reeb Graph representation (ERG) is proposed, which can handle degenerate critical points, and an algorithm is presented for its construction.