
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Z. Gigus, J. Canny, R. Seidel, "Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 542551, June, 1991.  
BibTex  x  
@article{ 10.1109/34.87341, author = {Z. Gigus and J. Canny and R. Seidel}, title = {Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {13}, number = {6}, issn = {01628828}, year = {1991}, pages = {542551}, doi = {http://doi.ieeecomputersociety.org/10.1109/34.87341}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects IS  6 SN  01628828 SP542 EP551 EPD  542551 A1  Z. Gigus, A1  J. Canny, A1  R. Seidel, PY  1991 KW  pattern recognition; aspect graphs; polyhedral objects; data structure; orthographic projection; viewpoint space; data structures; graph theory; pattern recognition VL  13 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
An efficient algorithm and a data structure for computing and representing the aspect graph of polyhedral objects under orthographic projection are presented. The aspect graph is an approach to representing 3D objects by a set of 2D views, for the purpose of object recognition. In this approach the viewpoint space is partitioned into regions such that in each region the qualitative structure of the line drawing does not change. The viewing data of an object is the partition of the viewpoint space together with a representative view in each region. The algorithm computes the viewing data for line drawings of polyhedral objects under orthographic projection.
[1] V.I. Arnol'd, "Indices of singular points of 1forms on a manifold with boundary, convolutions of invariants of reflection groups, and singular projections of smooth surfaces,"Russian Math. Surveys, vol. 34, no. 2, pp. 142, 1979.
[2] V.I. Arnol'd, "Singularities of systems of rays,"Russian Math. Surveys, vol. 38, no. 2, pp. 87176, 1983.
[3] P. J. Besl and R. C. Jain, "Threedimensional object recognition,"ACM Comput. Surveys, vol. 17, no. 1, pp. 75145, Mar. 1985.
[4] R.T. Chin and C. R. Dyer, "Modelbased recognition in robot vision,"ACM Comput. Surveys, vol. 18, no. 1, pp. 67108, Mar. 1986.
[5] I. Chakravarty and H. Freeman, "Characteristic views as a basis for threedimensional object recognition," inProc. Soc. PhotoOptical Instrumentation Eng. Conf. Robot Vision, vol. 336, SPIE, Bellingham, WA, 1982, pp. 3745.
[6] J. Callahan and R. Weiss, "A model for describing surface shape," inProc. IEEE Comput. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, New York, 1985, pp. 240245.
[7] D. Eggert and K. Bowyer, "Computing the orthographic projection aspect graph of solids of revolution," inProc. IEEE Workshop Interpretation of 3D Scenes, Nov. 1989, pp. 102108.
[8] Z. Gigus, J.F. Canny, and R. Seidel, "Efficiently computing and representing aspect graphs of polyhedral objects," inProc. Second Int. Conf. Computer Vision, IEEE, New York, Dec. 1988, pp. 3039.
[9] Z. Gigus and J. Malik, "Computing the aspect graph for line drawings of polyhedral objects," inProc. IEEE Comp. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, New York, June 1988, pp. 654661.
[10] Z. Gigus and J. Malik, "Computing the aspect graph for line drawings of polyhedral objects," inProc. 1988 IEEE Int. Conf. Robotics and Automation, IEEE, New York, Apr. 1988, pp. 15601566.
[11] Z. Gigus and J. Malik, "Computing the aspect graph for line drawings of polyhedral objects,"IEEE Trans. Pattern Anal. Machine Intell., vol. 12, no. 2, pp. 113122, Feb. 1990.
[12] M. Hebert and T. Kanade, "The 3dprofile method for object recognition," inProc. IEEE Comp. Soc. Conf. Computer Vision and Pattern Recognition, IEEE, New York, June 1988, pp. 458463.
[13] K. Ikeuchi, "Precompiling a geometrical model into an interpretation tree for object recognition in binpicking tasks," inProc. DARPA Image Understanding Workshop, Feb. 1987, pp. 321339.
[14] Y.L. Kergosien, "La famille des projections orthogonales d'une surface et ses singularités,"C.R. Acad. Sci. Paris, vol. 292, pp. 929932, 1981.
[15] D.J. Kriegman and I. Ponce, "Computing exact aspect graphs of curved objects: Solids of revolution," inProc. IEEE Workshop Interpretation of 3D Scenes, IEEE, New York, Nov. 1989, pp. 116121.
[16] D.J. Kriegman and I. Ponce, "Computing exact aspect graphs of curved objects: Parametric surfaces," inProc. Eighth Nat. Conf. Artificial Intelligence, Cambridge, MA: AAAI Press/MIT Press, June 1990, pp. 10741079.
[17] J.J. Koenderink and A.J. van Doorn, "The singularities of visual mapping,"Biol. Cybern., vol. 24, pp. 5159, 1976.
[18] J.J. Koenderink and A.J. van Doorn, "The internal representation of solid shape with respect to vision," Biol. Cybern., vol. 32, pp. 211216, 1979.
[19] K. Melhorn,Data Structures and Algorithms, vol. 3:Multidimensional Searching and Computational Geometry. New York: SpringerVerlag, 1984.
[20] W.H. Plantinga and C.R. Dyer, "An algorithm for constructing the aspect graph," inProc. 27th. Symp. Foundation of Computer Science, IEEE, New York, 1986, pp. 123131.
[21] W.H. Plantinga and C.R. Dyer, "Visibility, occlusion and the aspect graph," Univ. WisconsinMadison, Tech. Rep. 736, Dec. 1987.
[22] W.H. Plantinga and C.R. Dyer, "Visibility, occlusion and the aspect graph,"Int. J. Comput. Vision, 1990.
[23] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: SpringerVerlag, 1985.
[24] J.H. Rieger, "On the classification of views of piecewise smooth objects,"Image Vision Comput., vol. 5, no. 2, pp. 9197, May 1987.
[25] J. Stewman and K. Bowyer, "Aspect graphs for convex planarface objects," inProc. IEEE Comput. Soc. Workshop Computer Vision, IEEE, New York, Dec. 1987, pp. 123130.
[26] J. Stewman and K. Bowyer, "Creating the perspective projection aspect graph of polyhedral objects," inProc. Second Int. Conf. Computer Vision, IEEE, New York, Dec. 1988, pp. 494500.
[27] T. Sripradisvarakul and R. Jain, "Generating aspect graphs for curved objects," inProc. IEEE Workshop Interpretation of 3D Scenes, Nov. 1989, pp. 109115.
[28] N. Sarnak and R. E. Tarjan, "Planar point location using persistent search trees,"Commun. ACM, vol. 29, no. 7, pp. 669679, July 1986.