• DocumentCode
    3206131
  • Title

    Computing occlusion-free viewpoints

  • Author

    Tarabanis, Konstantinos ; Tsai, Roger Y.

  • Author_Institution
    IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
  • fYear
    1992
  • fDate
    15-18 Jun 1992
  • Firstpage
    802
  • Lastpage
    807
  • Abstract
    Methods for computing the locus of all viewpoints from which features on known polyhedral objects can be viewed in their entirety without being occluded by anything in the environment are presented. Convex and concave polyhedra with or without holes and the viewing model of perspective projection are used in this work. Based on properties of the occlusion-free and occluded loci of viewpoints, two methods for constructing these loci together with their complexity analysis are presented. In one method, a boundary representation of the occlusion-free locus is obtained. In the other, the locus of occluded viewpoints is expressed in terms of a constructive solid geometry representation that consists of a union of component solids. Implementation results are shown
  • Keywords
    computational geometry; image recognition; boundary representation; complexity analysis; constructive solid geometry; occluded loci; polyhedral objects; Solids; Utility programs;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Vision and Pattern Recognition, 1992. Proceedings CVPR '92., 1992 IEEE Computer Society Conference on
  • Conference_Location
    Champaign, IL
  • ISSN
    1063-6919
  • Print_ISBN
    0-8186-2855-3
  • Type

    conf

  • DOI
    10.1109/CVPR.1992.223168
  • Filename
    223168