Visibility, occlusion, and the aspect graph
- 1 November 1990
- journal article
- Published by Springer Science and Business Media LLC in International Journal of Computer Vision
- Vol. 5 (2), 137-160
- https://doi.org/10.1007/bf00054919
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Towards The Automatic Generation Of Recognition StrategiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Efficiently Computing And Representing Aspect Graphs Of Polyhedral ObjectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- From solid model to robot visionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The visual potential: One convex polygonComputer Vision, Graphics, and Image Processing, 1989
- Generating an interpretation tree from a CAD model for 3D-object recognition in bin-picking tasksInternational Journal of Computer Vision, 1987
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- Linear time algorithms for visibility and shortest path problems inside simple polygonsPublished by Association for Computing Machinery (ACM) ,1986
- Solid Modeling, Aspect Graphs, and Robot VisionPublished by Springer Science and Business Media LLC ,1984
- An Optimal Algorithm for Determining the Visibility of a Polygon from an EdgeIEEE Transactions on Computers, 1981
- A linear algorithm for computing the visibility polygon from a pointJournal of Algorithms, 1981