论文信息 - The minimum feature point set representing a convex polyhedral object

The minimum feature point set representing a convex polyhedral object

Abstract The minimum feature point set representing a convex polyhedral object is derived, based on which the stored data of a 3-D convex polyhedral object can be reduced. The feasibility of the proposed method is shown by several illustrative examples.

Jin-Jang Leou | Wen-Hsiang Tsai

[1] W.-H. Tsai,et al. New sensing strategies for monitoring moving polyhedral objects by machine vision , 1989, IEEE Trans. Syst. Man Cybern..

[2] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[3] James J. Little,et al. An iterative method for reconstructing convex polyhedra from extended gaussian images , 1983, AAAI 1983.

[4] Ramesh C. Jain,et al. Three-dimensional object recognition , 1985, CSUR.

[5] ARISTIDES A. G. REQUICHA,et al. Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[6] Dana H. Ballard,et al. Computer Vision , 1982 .

[7] Sargur N. Srihari,et al. Representation of Three-Dimensional Digital Images , 1981, CSUR.

[8] Katsushi Ikeuchi. Recognition of 3-D Objects Using the Extended Gaussian Image , 1981, IJCAI.

[9] Thomas C. Henderson. Efficient 3-D Object Representations for Industrial Vision Systems , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10] L. A. Li︠u︡sternik. Convex figures and polyhedra , 1966 .