{"title":"三角形贝塞尔裁剪","authors":"S. Roth, Patrick Diezi, M. Gross","doi":"10.1109/PCCGA.2000.883971","DOIUrl":null,"url":null,"abstract":"Introduces a new approach to finding ray-patch intersections with triangular Bernstein-Bezier patches of arbitrary degree. Unlike the approach of W.Sturzlinger (1998), which was based on a combination of hierarchical subdivision and a Newton-like iteration scheme, this work extends the concept of Bezier clipping to the triangular domain. The problem of reporting wrong intersections, which was inherent to the original Bezier clipping algorithm of T. Nishita et al. (1990), is investigated and opposed to the triangular case. It turns out that reporting wrong hits is very improbable, even close to impossible, in the triangular setup.","PeriodicalId":342067,"journal":{"name":"Proceedings the Eighth Pacific Conference on Computer Graphics and Applications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Triangular Bezier clipping\",\"authors\":\"S. Roth, Patrick Diezi, M. Gross\",\"doi\":\"10.1109/PCCGA.2000.883971\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Introduces a new approach to finding ray-patch intersections with triangular Bernstein-Bezier patches of arbitrary degree. Unlike the approach of W.Sturzlinger (1998), which was based on a combination of hierarchical subdivision and a Newton-like iteration scheme, this work extends the concept of Bezier clipping to the triangular domain. The problem of reporting wrong intersections, which was inherent to the original Bezier clipping algorithm of T. Nishita et al. (1990), is investigated and opposed to the triangular case. It turns out that reporting wrong hits is very improbable, even close to impossible, in the triangular setup.\",\"PeriodicalId\":342067,\"journal\":{\"name\":\"Proceedings the Eighth Pacific Conference on Computer Graphics and Applications\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-10-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings the Eighth Pacific Conference on Computer Graphics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCGA.2000.883971\",\"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 the Eighth Pacific Conference on Computer Graphics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCGA.2000.883971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Introduces a new approach to finding ray-patch intersections with triangular Bernstein-Bezier patches of arbitrary degree. Unlike the approach of W.Sturzlinger (1998), which was based on a combination of hierarchical subdivision and a Newton-like iteration scheme, this work extends the concept of Bezier clipping to the triangular domain. The problem of reporting wrong intersections, which was inherent to the original Bezier clipping algorithm of T. Nishita et al. (1990), is investigated and opposed to the triangular case. It turns out that reporting wrong hits is very improbable, even close to impossible, in the triangular setup.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
