This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Comments on "Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects"
January 1996 (vol. 18 no. 1)
pp. 57-58

Abstract—This correspondence is originated by the definition of aspect given in a recent paper [1] on the computation of aspect graphs of polyhedra. Simple examples are presented which show that the data stored according to this definition can be unsuitable for identifying an object or its attitude through a topological match. A definition is suggested which does not incur the problems pointed out.

[1] Z. Gigus, J. Canny, and R. Seidel, "Efficiently computing and representing aspect graphs of polyhedral objects," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 13, no. 6, pp. 542-551, June 1991.
[2] H. Platinga and C.R. Dyer, "Visibility, occlusion and the aspect graph, Int'l J. Computer Vision, vol. 5, pp. 137-160, 1990.
[3] J. Stewman and K. Bowyer, "Creating the perspective projection aspect graph of polyhedral objects," Int'l Conf. Computer Vision, pp. 494-500, 1988.

Index Terms:
Aspect graphs, polyhedra, topological definition of aspect.
Citation:
Aldo Laurentini, "Comments on "Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects"," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 1, pp. 57-58, Jan. 1996, doi:10.1109/34.476011
Usage of this product signifies your acceptance of the Terms of Use.