A BSP-based algorithm for dimensionally nonhomogeneous planar implicit curves with topological guarantees
ACM Trans. Graph.(2009)
摘要
Mathematical systems (e.g., Mathematica, Maple, Matlab, and DPGraph) easily plot planar algebraic curves implicitly defined by polynomial functions. However, these systems, and most algorithms found in the literature, cannot draw many implicit curves correctly; in particular, those with singularities (self-intersections, cusps, and isolated points). They do not detect sign-invariant components either, because they use numerical methods based on the Bolzano corollary, that is, they assume that the curve-describing function f flips sign somewhere in a line segment &ABhorbar; that crosses the curve, or f(A)·f(B) Generalized False Position (GFP) method. It allows us to sample an implicit curve against the Binary Space Partitioning (BSP), say bisection lines, of a rectangular region of R2. Interestingly, the GFP method can also be used to determine isolated points of the curve. The result is a general algorithm for sampling and rendering planar implicit curves with topological guarantees.
更多查看译文
关键词
dimensionally nonhomogeneous,planar implicit curve,bisection line,implicit curve,Bolzano corollary,topological guarantee,numerical algorithms,BSP-based algorithm,geometric computing,isolated point,numerical method,planar algebraic,Generalized False Position,binary space partitioning,GFP method,Binary Space Partitioning,implicit curves
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要