计算无遮挡视点

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Pub Date : 1992-06-15 DOI:10.1109/CVPR.1992.223168

K. Tarabanis, R. Tsai

{"title":"计算无遮挡视点","authors":"K. Tarabanis, R. Tsai","doi":"10.1109/CVPR.1992.223168","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":325476,"journal":{"name":"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"134","resultStr":"{\"title\":\"Computing occlusion-free viewpoints\",\"authors\":\"K. Tarabanis, R. Tsai\",\"doi\":\"10.1109/CVPR.1992.223168\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":325476,\"journal\":{\"name\":\"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"134\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPR.1992.223168\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPR.1992.223168","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 134

摘要

提出了一种计算所有视点轨迹的方法，从这些视点轨迹中可以完整地查看已知多面体物体的特征，而不会被环境中的任何物体遮挡。在这项工作中使用凸多面体和凹多面体，有孔或无孔以及透视投影的观看模型。基于视点无遮挡和遮挡轨迹的特性，提出了两种视点无遮挡轨迹的构造方法及其复杂度分析。在一种方法中，获得了无遮挡轨迹的边界表示。在另一种情况下，遮挡视点的轨迹以由组成实体的联合组成的建设性实体几何表示形式表示。显示了实现结果

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computing occlusion-free viewpoints

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition

自引率

0.00%

发文量