Segmentation of real algebraic plane curves

05/22/2016
by   Cesar Massri, et al.
0

In this article we give an implementation of the standard algorithm to segment a real algebraic plane curve defined implicitly. Our implementation is efficient and simpler than previous. We use global information to count the number of half-branches at a critical point.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2018

Counting higher order tangencies for plane curves

We prove that n plane algebraic curves determine O(n^(k+2)/(k+1)) points...
research
08/05/2019

Sommerfeld type integrals for discrete diffraction problems

Three discrete problems for Helmholtz equation is studied analytically u...
research
01/24/2018

Threadable Curves

We define a plane curve to be threadable if it can rigidly pass through ...
research
02/22/2023

Algorithm for connectivity queries on real algebraic curves

We consider the problem of answering connectivity queries on a real alge...
research
06/26/2019

Voronoi Cells in Metric Algebraic Geometry of Plane Curves

Voronoi cells of varieties encode many features of their metric geometry...
research
05/30/2020

Critical Point Calculations by Numerical Inversion of Functions

In this work, we propose a new approach to the problem of critical point...
research
05/06/2019

Geometric Firefighting in the Half-plane

In 2006, Alberto Bressan suggested the following problem. Suppose a circ...

Please sign up or login with your details

Forgot password? Click here to reset