Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast
Given a Cylindrical Algebraic Decomposition  of an implicitly defined algebraic curve, visualizing distinct curve arcs is not as easy as it stands because, despite the absence of singularities in the interior, the arcs can pass arbitrary close to each other. We present an algorithm to visualize distinct arcs of algebraic curves efficiently and precise (at a given resolution), irrespective of how close to each other they actually pass. Our hybrid method inherits the ideas of subdivision and curve-tracking methods. With an adaptive mixed-precision model we can render the majority of curves using machine arithmetic without sacrificing the exactness of the final result. The correctness and applicability of our algorithm is borne out by the success of our web-demo presented in .
KeywordsAlgebraic curves geometric computing curve rendering visualization exact computation
Unable to display preview. Download preview PDF.
- 1.Alberti, L., Mourrain, B.: Visualisation of Implicit Algebraic Curves. In: Pacific Conference on Computer Graphics and Applications, pp. 303–312 (2007)Google Scholar
- 3.Berberich, E., Emeliyanenko, P.: Cgal’s Curved Kernel via Analysis. Technical Report ACS-TR-123203-04, Algorithms for Complex Shapes (2008)Google Scholar
- 6.Chandler, R.: A tracking algorithm for implicitly defined curves. IEEE Computer Graphics and Applications 8 (1988)Google Scholar
- 10.Emeliyanenko, P.: Visualization of Points and Segments of Real Algebraic Plane Curves. Master’s thesis, Universität des Saarlandes (2007)Google Scholar
- 16.Möller, T., Yagel, R.: Efficient Rasterization of Implicit Functions. Tech. rep., Department of Computer and Information Science, Ohio State University (1995)Google Scholar
- 17.Morgado, J., Gomes, A.: A Derivative-Free Tracking Algorithm for Implicit Curves with Singularities. In: ICCSA, pp. 221–228 (2004)Google Scholar