{"title":"计算二次曲面固体的特征视图","authors":"S. Chen, H. Freeman","doi":"10.1109/ICPR.1990.118068","DOIUrl":null,"url":null,"abstract":"An algorithm is presented for computing the characteristic views (CVs) of quadric-surfaced solids. The CVs are determined by analyzing the characteristic-view domains of the object by relating changes in the topology of the object's line structure to changes in the occlusion of 3D edges. The main task of the algorithm is to compute the envelope boundaries for viewpoint regions for which the object's visible-line projections have topologically equivalent line-junction graphs. By using the concepts of generalized edge, generalized face, and generalized vertex and using the techniques of order-of-visibility propagation and edge classification, the algorithm can efficiently compute both local and global visibility of edge segments, and therefrom compute the required envelope boundaries. This algorithm is shown to hold for quadric-surfaced solids in general and to treat a polyhedral object as a special case.<<ETX>>","PeriodicalId":135937,"journal":{"name":"[1990] Proceedings. 10th International Conference on Pattern Recognition","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Computing characteristic views of quadric-surfaced solids\",\"authors\":\"S. Chen, H. Freeman\",\"doi\":\"10.1109/ICPR.1990.118068\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An algorithm is presented for computing the characteristic views (CVs) of quadric-surfaced solids. The CVs are determined by analyzing the characteristic-view domains of the object by relating changes in the topology of the object's line structure to changes in the occlusion of 3D edges. The main task of the algorithm is to compute the envelope boundaries for viewpoint regions for which the object's visible-line projections have topologically equivalent line-junction graphs. By using the concepts of generalized edge, generalized face, and generalized vertex and using the techniques of order-of-visibility propagation and edge classification, the algorithm can efficiently compute both local and global visibility of edge segments, and therefrom compute the required envelope boundaries. This algorithm is shown to hold for quadric-surfaced solids in general and to treat a polyhedral object as a special case.<<ETX>>\",\"PeriodicalId\":135937,\"journal\":{\"name\":\"[1990] Proceedings. 10th International Conference on Pattern Recognition\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990] Proceedings. 10th International Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPR.1990.118068\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990] Proceedings. 10th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.1990.118068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computing characteristic views of quadric-surfaced solids
An algorithm is presented for computing the characteristic views (CVs) of quadric-surfaced solids. The CVs are determined by analyzing the characteristic-view domains of the object by relating changes in the topology of the object's line structure to changes in the occlusion of 3D edges. The main task of the algorithm is to compute the envelope boundaries for viewpoint regions for which the object's visible-line projections have topologically equivalent line-junction graphs. By using the concepts of generalized edge, generalized face, and generalized vertex and using the techniques of order-of-visibility propagation and edge classification, the algorithm can efficiently compute both local and global visibility of edge segments, and therefrom compute the required envelope boundaries. This algorithm is shown to hold for quadric-surfaced solids in general and to treat a polyhedral object as a special case.<>