Certified simultaneous isotopic approximation of pairs of curves via subdivision

02/09/2023
by   Michael Burr, et al.
0

We present a certified algorithm based on subdivision for computing an isotopic approximation to a pair of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main challenge in this computation is to correctly and efficiently compute the intersections of the curves. To address this issue, we introduce a new, but simple test that guarantees the global correctness of our output.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2023

On the number of tangencies among 1-intersecting curves

Let C be a set of curves in the plane such that no three curves in C int...
research
09/16/2020

Approximating the packedness of polygonal curves

In 2012 Driemel et al. <cit.> introduced the concept of c-packed curves ...
research
10/10/2016

Inverse Diffusion Curves using Shape Optimization

The inverse diffusion curve problem focuses on automatic creation of dif...
research
10/03/2021

Hinged Truchet tiling fractals

This article describes a new method of producing space filling fractal d...
research
09/02/2020

Isotopic Arrangement of Simple Curves: an Exact Numerical Approach based on Subdivision

This paper presents the first purely numerical (i.e., non-algebraic) sub...
research
05/30/2018

Fast L1-Minimization Algorithm for Sparse Approximation Based on an Improved LPNN-LCA framework

The aim of sparse approximation is to estimate a sparse signal according...
research
01/05/2018

Vectorization of Line Drawings via PolyVector Fields

Image tracing is a foundational component of the workflow in graphic des...

Please sign up or login with your details

Forgot password? Click here to reset