Visualizing Planar and Space Implicit Real Algebraic Curves with Singularities

12/16/2019
by   Changbo Chen, et al.
0

We present a new method for visualizing implicit real algebraic curves inside a bounding box in the 2-D or 3-D ambient space based on numerical continuation and critical point methods. The underlying techniques work also for tracing space curve in higher-dimensional space. Since the topology of a curve near a singular point of it is not numerically stable, we trace only the curve outside neighborhoods of singular points and replace each neighborhood simply by a point, which produces a polygonal approximation that is ϵ-close to the curve. Such an approximation is more stable for defining the numerical connectedness of the complement of the projection of the curve in ℝ^2, which is important for applications such as solving bi-parametric polynomial systems. The algorithm starts by computing three types of key points of the curve, namely the intersection of the curve with small spheres centered at singular points, regular critical points of every connected components of the curve, as well as intersection points of the curve with the given bounding box. It then traces the curve starting with and in the order of the above three types of points. This basic scheme is further enhanced by several optimizations, such as grouping singular points in natural clusters, tracing the curve by a try-and-resume strategy and handling "pseudo singular points". The effectiveness of the algorithm is illustrated by numerous examples. This manuscript extends our preliminary results that appeared in CASC 2018.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2021

A Companion Curve Tracing Method for Rank-deficient Polynomial Systems

We propose a method for tracing implicit real algebraic curves defined b...
research
03/16/2019

Computing the intersection of two quadrics through projection and lifting

This paper is devoted to presenting a method to determine the intersecti...
research
03/16/2023

Improved Moore-Penrose continuation algorithm for the computation of problems with critical points

Using typical solution strategies to compute the solution curve of chall...
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
01/28/2019

On the Complexity of Computing the Topology of Real Algebraic Space Curves

In this paper, we present a deterministic algorithm to find a strong gen...
research
02/05/2019

A non-iterative method for robustly computing the intersections between a line and a curve or surface

The need to compute the intersections between a line and a high-order cu...
research
11/08/2018

Fast, High Precision Ray/Fiber Intersection using Tight, Disjoint Bounding Volumes

Analyzing and identifying the shortcomings of current subdivision method...

Please sign up or login with your details

Forgot password? Click here to reset