Automating view function generation for walk-through animation using a Reed graph
Computer Animation '90
Graph-directed modelling from serial sections
The Visual Computer: International Journal of Computer Graphics
The homotopy model: a generalized model for smooth surface generation from cross sectional data
The Visual Computer: International Journal of Computer Graphics - Special issue on computer graphics international '89(CGI'89)
Visualization: new concepts and techniques to integrate diverse application areas
Scientific visualization of physical phenomena
Optimal surface reconstruction from planar contours
Communications of the ACM
Surface Coding Based on Morse Theory
IEEE Computer Graphics and Applications
Conversion of complex contour line definitions into polygonal element mosaics
SIGGRAPH '78 Proceedings of the 5th annual conference on Computer graphics and interactive techniques
A feature-based approach for smooth surfaces
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Tracking scalar features in unstructured datasets
Proceedings of the conference on Visualization '98
Level set diagrams of polyhedral objects
Proceedings of the fifth ACM symposium on Solid modeling and applications
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Semi-regular mesh extraction from volumes
Proceedings of the conference on Visualization '00
Shape abstraction using computational topology techniques
From geometric modeling to shape modeling
Surface Reconstruction by Multiaxial Triangulation
IEEE Computer Graphics and Applications
Volume Data Mining Using 3D Field Topology Analysis
IEEE Computer Graphics and Applications
Extended Reeb Graphs for Surface Understanding and Description
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Loops in reeb graphs of 2-manifolds
Proceedings of the nineteenth annual symposium on Computational geometry
Removing excess topology from isosurfaces
ACM Transactions on Graphics (TOG)
Time-varying reeb graphs for continuous space-time data
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On detecting all saddle points in 2D images
Pattern Recognition Letters
A robust technique for surface reconstruction from orthogonal slices
Machine Graphics & Vision International Journal
Simultaneous shape decomposition and skeletonization
Proceedings of the 2006 ACM symposium on Solid and physical modeling
Topological shape signature for 3D object modelling
MS'06 Proceedings of the 17th IASTED international conference on Modelling and simulation
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Journal of Mathematical Imaging and Vision
Three-Dimensional Surface Mesh Segmentation Using Curvedness-Based Region Growing Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reeb graphs for shape analysis and applications
Theoretical Computer Science
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
Time-varying Reeb graphs for continuous space--time data
Computational Geometry: Theory and Applications
Efficient algorithms for computing Reeb graphs
Computational Geometry: Theory and Applications
Flow Complexity: Fast Polytopal Graph Complexity and 3D Object Clustering
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
T-map: a topological approach to visual exploration of time-varying volume data
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
A randomized O(m log m) time algorithm for computing Reeb graphs of arbitrary simplicial complexes
Proceedings of the twenty-sixth annual symposium on Computational geometry
Object recognition through topo-geometric shape models using error-tolerant subgraph isomorphisms
IEEE Transactions on Image Processing
Detecting critical regions in multidimensional data sets
Computers & Mathematics with Applications
Automatic detection of anatomical features on 3D ear impressions for canonical representation
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part III
Reeb graphs: approximation and persistence
Proceedings of the twenty-seventh annual symposium on Computational geometry
Morse connections graph for shape representation
ACIVS'05 Proceedings of the 7th international conference on Advanced Concepts for Intelligent Vision Systems
On volume distribution features based 3d model retrieval
ICAT'06 Proceedings of the 16th international conference on Advances in Artificial Reality and Tele-Existence
A deterministic o(m log m) time algorithm for the reeb graph
Proceedings of the twenty-eighth annual symposium on Computational geometry
Stability of Reeb Graphs of Closed Curves
Electronic Notes in Theoretical Computer Science (ENTCS)
Flooding countries and destroying dams
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Simplified reeb graph as effective shape descriptor for the striatum
MeshMed'12 Proceedings of the 2012 international conference on Mesh Processing in Medical Image Analysis
Pose analysis using spectral geometry
The Visual Computer: International Journal of Computer Graphics
| Hi-index | 0.00 |
The Reeb graph represents the topological skeleton of a 3-D object and shows between which contours the surface patches should be generated. To construct the graph automatically, a weight function is defined for a pair of contours with each contour lying on the adjacent cross sections. First, the algorithm automatically generates the major parts of the edges of the Reeb graph where the number of contours does not change. Then the rest of the graph is determined by using the weight function and prior knowledge of the number of holes the object has. Specifically, the graph is completed by adding edges that do not contradict the known number of holes in descending order of the weight.