Efficiently Computing And Representing Aspect Graphs Of Polyhedral Objects
暂无分享,去创建一个
[1] Kurt Mehlhorn,et al. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.
[2] Jitendra Malik,et al. Computing the aspect graph for line drawings of polyhedral objects , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[3] Joachim H. Rieger,et al. On the classification of views of piecewise smooth objects , 1987, Image Vis. Comput..
[4] Charles R. Dyer,et al. An algorithm for constructing the aspect graph , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[5] Vladimir I. Arnold,et al. INDICES OF SINGULAR POINTS OF 1-FORMS ON A MANIFOLD WITH BOUNDARY, CONVOLUTION OF INVARIANTS OF REFLECTION GROUPS, AND SINGULAR PROJECTIONS OF SMOOTH SURFACES , 1979 .
[6] Herbert Freeman,et al. Characteristic Views As A Basis For Three-Dimensional Object Recognition , 1982, Other Conferences.
[7] Michael Werman,et al. The visual potential: One convex polygon , 1989, Comput. Vis. Graph. Image Process..
[8] Robert E. Tarjan,et al. Planar point location using persistent search trees , 1986, CACM.
[9] V. Arnold. Singularities of systems of rays , 1983 .