{"title":"基于点包容范式的非简单封闭曲线的高效填充算法","authors":"A. Fabris, L. Silva, A. R. Forrest","doi":"10.1109/SIGRA.1997.625138","DOIUrl":null,"url":null,"abstract":"The point containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. The paper presents a technique to counteract the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. The implemented algorithm handles complex geometries such as self-intersecting closed curves.","PeriodicalId":445648,"journal":{"name":"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"An efficient filling algorithm for non-simple closed curves using the point containment paradigm\",\"authors\":\"A. Fabris, L. Silva, A. R. Forrest\",\"doi\":\"10.1109/SIGRA.1997.625138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The point containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. The paper presents a technique to counteract the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. The implemented algorithm handles complex geometries such as self-intersecting closed curves.\",\"PeriodicalId\":445648,\"journal\":{\"name\":\"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings X Brazilian Symposium on Computer Graphics and Image Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIGRA.1997.625138\",\"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 X Brazilian Symposium on Computer Graphics and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIGRA.1997.625138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An efficient filling algorithm for non-simple closed curves using the point containment paradigm
The point containment predicate which specifies if a point is part of a mathematically defined shape or not is one of the most basic notions in raster graphics. The paper presents a technique to counteract the main disadvantage of point containment algorithms: their quadratic time complexity with increasing resolution. The implemented algorithm handles complex geometries such as self-intersecting closed curves.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
