{"title":"Chord distributions for shape matching","authors":"Stephen P. Smith, Anil K. Jain","doi":"10.1016/0146-664X(82)90084-3","DOIUrl":"10.1016/0146-664X(82)90084-3","url":null,"abstract":"<div><p>A shape matching method based on concepts tied to integral geometry is studied. The method consists of computing the distribution of random chords over the figures to be matched and comparing them by means of the Kolmogorov-Smirnov test. A simplified form of the procedure for matching figures to a circle yields a test for circularity. It is generalized to obtain a statistical test for shape matching and then modified to produce a dissimilarity measure between shapes. The circularity test is performed on 30 shapes and compared to two other circularity measures found in the literature. Experiments are also performed using the matching procedures.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 259-271"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90084-3","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131149099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A discrete spatial representation for lateral motion stereo","authors":"Nelson J. Bridwell, Thomas S. Huang","doi":"10.1016/0146-664X(82)90088-0","DOIUrl":"https://doi.org/10.1016/0146-664X(82)90088-0","url":null,"abstract":"","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Page 296"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90088-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136889071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Shape and correspondence","authors":"Jon A. Webb, J.K. Aggarwal","doi":"10.1016/0146-664X(82)90091-0","DOIUrl":"https://doi.org/10.1016/0146-664X(82)90091-0","url":null,"abstract":"","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 296-297"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90091-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136940335","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Understanding engineering drawings","authors":"Robert M. Haralick, David Queeney","doi":"10.1016/0146-664X(82)90083-1","DOIUrl":"https://doi.org/10.1016/0146-664X(82)90083-1","url":null,"abstract":"<div><p>It is shown that understanding the three dimensional objects depicted in the orthographic views employed in engineering drawings can be achieved by solving a sequence of three consistent labeling problems. The constraints used in the engineering drawings are stated, the translation to the constraints of the consistent labeling problems are given, and the computer solution is illustrated by the execution of an appropriate tree search.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 244-258"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90083-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136940350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Closed-form extension of the anharmonic ratio toN-space","authors":"Michael H. Brill, Eamon B. Barrett","doi":"10.1016/0146-664X(82)90094-6","DOIUrl":"10.1016/0146-664X(82)90094-6","url":null,"abstract":"","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Page 297"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90094-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128927279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A two-pass filling algorithm for raster graphics","authors":"A. Distante, N. Veneziani","doi":"10.1016/0146-664X(82)90087-9","DOIUrl":"https://doi.org/10.1016/0146-664X(82)90087-9","url":null,"abstract":"<div><p>An algorithm for filling irregular polygons is presented. It is designed to operate in raster mode and uses the refresh memory of a graphic display as working space. The algorithm has been implemented in a host computer but it can be implemented easily within the microprocessor controlling the display. All areas contoured by closed lines are shaded at the same time according to a preassigned color code.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 288-295"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90087-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136940349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An isotropic four-point interpolation based on cubic splines","authors":"Koichi Harada, Eihachiro Nakamae","doi":"10.1016/0146-664X(82)90086-7","DOIUrl":"10.1016/0146-664X(82)90086-7","url":null,"abstract":"<div><p>A more efficient algorithm than that of J. E. Midgley (<em>Computer Graphics and Image Processing</em><strong>11</strong>, 1979, 192–196) is given for smooth curve construction; the amount of calculation required is diminished, and the three major conditions (local, isotropic, and applicable to curves in an arbitrary number of dimensions), strongly required for data interpolation, are also satisfied by our method. The new method is based on cubic spline interpolation, while Midgley's is based on circular interpolation.</p></div>","PeriodicalId":100313,"journal":{"name":"Computer Graphics and Image Processing","volume":"20 3","pages":"Pages 283-287"},"PeriodicalIF":0.0,"publicationDate":"1982-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0146-664X(82)90086-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116066317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}