使用近似几何基元的平面形状操纵
Planar shape manipulation using approximate geometric primitives
摘要:
我们提出了强大的算法集操作和欧几里得变换的曲线形状在平面上使用近似几何图元。我们使用一个细化算法来确保一致性。对于大小为$n$且存在$k=\bigo(n^2)$一致性违规的输入,其计算复杂度为$\bigo(n\log n+k)$。输出与几何图元一样精确。我们验证我们的算法在浮点使用序列的六个集合操作和欧几里得变换的形状有界的曲线代数度~1~6。我们测试通用和退化输入。关键词:稳健计算几何,平面细分,集合运算。
英文摘要:
We present robust algorithms for set operations and Euclidean transformations of curved shapes in the plane using approximate geometric primitives. We use a refinement algorithm to ensure consistency. Its computational complexity is $\bigo(n\log n+k)$ for an input of size $n$ with $k=\bigo(n^2)$ consistency violations. The output is as accurate as the geometric primitives. We validate our algorithms in floating point using sequences of six set operations and Euclidean transforms on shapes bounded by curves of algebraic degree~1 to~6. We test generic and degenerate inputs. Keywords: robust computational geometry, plane subdivisions, set operations.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。