Sciweavers

557 search results - page 9 / 112
» A Type-Coercion Problem in Computer Algebra
Sort
View
COMPGEOM
2001
ACM
13 years 11 months ago
PRECISE: efficient multiprecision evaluation of algebraic roots and predicates for reliable geometric computation
: Many geometric problems like generalized Voronoi diagrams, medial axis computations and boundary evaluation involve computation and manipulation of non-linear algebraic primitive...
Shankar Krishnan, Mark Foskey, Tim Culver, John Ke...
STACS
1999
Springer
13 years 11 months ago
Lower Bounds for Dynamic Algebraic Problems
Abstract. We consider dynamic evaluation of algebraic functions (matrix multiplication, determinant, convolution, Fourier transform, etc.) in the model of Reif and Tate; i.e., if f...
Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter...
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
14 years 1 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
ICRA
2000
IEEE
120views Robotics» more  ICRA 2000»
13 years 12 months ago
An Algebraic Solution to the Problem of Collision Detection for Rigid Polyhedral Objects
This paper describes a new collision detection algorithm designed for interactive manipulation in virtual environments. Making some assumptions on objects motion, the collision ti...
Stephane Redon, Abderrahmane Kheddar, Sabine Coqui...
CORR
2007
Springer
217views Education» more  CORR 2007»
13 years 7 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen