Comments on "Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects" January 1996 (vol. 18 no. 1) pp. 57-58
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.476011
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.
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. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||