### Abstract

Given a real valued function f(X, Y), a box region B0⊆R{double-struck}^{2} and ε>0, we want to compute an ε-isotopic polygonal approximation to the restriction of the curve S=f^{-1}(0)={p∈R{double-struck}^{2}:f(p)=0} to B_{0}. We focus on subdivision algorithms because of their adaptive complexity and ease of implementation. Plantinga & Vegter gave a numerical subdivision algorithm that is exact when the curve S is bounded and non-singular. They used a computational model that relied only on function evaluation and interval arithmetic. We generalize their algorithm to any bounded (but possibly non-simply connected) region that does not contain singularities of S. With this generalization as a subroutine, we provide a method to detect isolated algebraic singularities and their branching degree. This appears to be the first complete purely numerical method to compute isotopic approximations of algebraic curves with isolated singularities.

Original language | English (US) |
---|---|

Pages (from-to) | 131-152 |

Number of pages | 22 |

Journal | Journal of Symbolic Computation |

Volume | 47 |

Issue number | 2 |

DOIs | |

State | Published - Feb 2012 |

### Keywords

- Complete numerical algorithm
- Evaluation bound
- Implicit algebraic curve
- Meshing
- Root bound
- Singularity
- Subdivision algorithm

### ASJC Scopus subject areas

- Algebra and Number Theory
- Computational Mathematics

## Fingerprint Dive into the research topics of 'Complete subdivision algorithms, II: Isotopic meshing of singular algebraic curves'. Together they form a unique fingerprint.

## Cite this

*Journal of Symbolic Computation*,

*47*(2), 131-152. https://doi.org/10.1016/j.jsc.2011.08.021