Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision

From MaRDI portal



Abstract: This paper presents the first purely numerical (i.e., non-algebraic) subdivision algorithm for the isotopic approximation of a simple arrangement of curves. The arrangement is "simple" in the sense that any three curves have no common intersection, any two curves intersect transversally, and each curve is non-singular. A curve is given as the zero set of an analytic function f:mathbbR2ightarrowmathbbR2, and effective interval forms of f,fracpartialfpartialx,fracpartialfpartialy are available. Our solution generalizes the isotopic curve approximation algorithms of Plantinga-Vegter (2004) and Lin-Yap (2009). We use certified numerical primitives based on interval methods. Such algorithms have many favorable properties: they are practical, easy to implement, suffer no implementation gaps, integrate topological with geometric computation, and have adaptive as well as local complexity. A version of this paper without the appendices appeared in Lien et al. (2014).





Describes a project that uses

Uses Software






This page was built for publication: Isotopic Arrangement of Simple Curves: An Exact Numerical Approach Based on Subdivision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879135)