
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Yoshihisa Shinagawa, Tosiyasu L. Kunii, "Constructing a Reeb graph automatically from cross sections," IEEE Computer Graphics and Applications, vol. 11, no. 6, pp. 4451, November/December, 1991.  
BibTex  x  
@article{ 10.1109/38.103393, author = {Yoshihisa Shinagawa and Tosiyasu L. Kunii}, title = {Constructing a Reeb graph automatically from cross sections}, journal ={IEEE Computer Graphics and Applications}, volume = {11}, number = {6}, issn = {02721716}, year = {1991}, pages = {4451}, doi = {http://doi.ieeecomputersociety.org/10.1109/38.103393}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  MGZN JO  IEEE Computer Graphics and Applications TI  Constructing a Reeb graph automatically from cross sections IS  6 SN  02721716 SP44 EP51 EPD  4451 A1  Yoshihisa Shinagawa, A1  Tosiyasu L. Kunii, PY  1991 VL  11 JA  IEEE Computer Graphics and Applications ER   
The Reeb graph represents the topological skeleton of a 3D 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.
1. Y. Shinagawa and T.L. Kunii, "The Homotopy Model: A Generalized Model for Smooth Surface Generation from Cros Sectional Data,"The Visual Computer, Vol. 7, No. 2, Apr. 1991, pp. 7286.
2. H. Fuchs. Z. M. Kedem, and S. P. Uselton, "Optimal surface reconstruction from planar contours,"Commun. ACM, vol. 20, Oct. 1977.
3. H.N. Christiansen and T.W. Sederberg, "Conversion of Complex Contour Line Definitions into Polygonal Element Mosaics,"Computer Graphics(Proc. SIGGRAPH), Vol. 12, No. 3, Aug. 1978, pp. 187192.
4. Y. Shinagawa, Y.L. Kergosien, and T.L. Kunii, "Surface Coding Based on Morse Theory,"IEEE CG&A, Vol. 11, No. 5, Sept. 1991, pp. 6678.
5. Y. Shinagawa et al., "Automating View Function Generation for Walkthrough Animation," inProc. of Computer Animation 90, N. MagnenatThalmann and D. Thalmann, eds., Springer, New York, 1990, pp. 227237.
6. T.L. Kunii and Y. Shinagawa, "Visualization: New Concepts and Techniques to Integrate Diverse Application Areas," inScientific Visualization of Physical Phenomena, N.M. Patrikalakis, ed., Springer, New York, 1991, pp. 325.
7. G. Reeb, "Sur les Points Singuliers d'une Forme de Pfaff Completement Integrable ou d'un Fonction Numerique [On the Singular Points of a Completely Integrable Pfaff Formor of a Numerical Function],"Comptes Rendus Acad. Sciences Paris, Vol. 222, 1946, pp. 847849.
8. C. Giersten, A. Halvorsen, and P.R. Flood, "GraphDirected Modeling from Serial Sections,"Visual Computer, Vol. 6, No. 5, September 1991, pp. 284290.
9. M.A. Armstrong,Basic Topology, Springer, New York, 1983.
10. Y. Nomura et al., "Walking through a Human Ear,"Acta Otolaryngologica, Vol. 107, No. 56, MayJune 1989, pp. 366370.