Visualizing arcs of implicit algebraic curves, exactly and fast

9Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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]. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Emeliyanenko, P., Berberich, E., & Sagraloff, M. (2009). Visualizing arcs of implicit algebraic curves, exactly and fast. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5875 LNCS, pp. 608–619). https://doi.org/10.1007/978-3-642-10331-5_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free