Abstract

Let R\mathbb{R} be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in Rn\mathbb{R}^n given as the vanishing set of a polynomial system. This problem plays an important role for studying rigidity properties of mechanism in material designs. In this paper, we design an algorithm which solves this problem. It is based on the computations of critical points as well as roadmaps for answering connectivity queries in real algebraic sets. This leads to a probabilistic algorithm of complexity (nd)O(nlog⁡(n))(nd)^{O(n\log(n))} for computing the real isolated points of real algebraic hypersurfaces of degree dd. It allows us to solve in practice instances which are out of reach of the state-of-the-art.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.