An efficient filling algorithm for non-simple closed curves using the point containment paradigm
An efficient filling algorithm for non-simple closed curves using the point containment paradigm
复制标题
使用点包含范式的非简单闭合曲线的高效填充算法
DOI：
--
复制
发表时间：
1997
期刊：
影响因子：
--
通讯作者：
Forrest
中科院分区：
文献类型：
--
作者：
Antonio Elias;Fabris Luciano;Silva A Robin;Forrest
点包含谓词是光栅图形中最基本的概念之一，它指定一个点是否是数学定义的形状的一部分。本文提出了一种技术，以抵消点包含算法的主要缺点：他们的二次时间复杂度随着分辨率的增加。实现的算法处理复杂的几何形状，如自相交的封闭曲线。
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.