Sciweavers

JC
2000
78views more  JC 2000»
13 years 11 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...
DIMACS
2001
14 years 29 days ago
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
Thorsten Theobald