Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast

  • Pavel Emeliyanenko
  • Eric Berberich
  • Michael Sagraloff
Conference paper

DOI: 10.1007/978-3-642-10331-5_57

Volume 5875 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Emeliyanenko P., Berberich E., Sagraloff M. (2009) Visualizing Arcs of Implicit Algebraic Curves, Exactly and Fast. In: Bebis G. et al. (eds) Advances in Visual Computing. ISVC 2009. Lecture Notes in Computer Science, vol 5875. Springer, Berlin, Heidelberg

Abstract

Given a Cylindrical Algebraic Decomposition [2] 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 [11].

Keywords

Algebraic curves geometric computing curve rendering visualization exact computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Pavel Emeliyanenko
    • 1
  • Eric Berberich
    • 2
  • Michael Sagraloff
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany
  2. 2.School of Computer ScienceTel-Aviv UniversityTel-AvivIsrael