Sciweavers

1730 search results - page 22 / 346
» Algebra and Computation
Sort
View
CAD
2006
Springer
13 years 7 months ago
Computing minimum distance between two implicit algebraic surfaces
The minimum distance computation problem between two surfaces is very important in many applications such as robotics, CAD/CAM and computer graphics. Given two implicit algebraic ...
Xiao-Diao Chen, Jun-Hai Yong, Guo-Qin Zheng, Jean-...
JNCA
2008
104views more  JNCA 2008»
13 years 7 months ago
Computing in social networks with relationship algebra
Communities are the latest phenomena on the Internet. At the heart of each community lies a social network. In this paper, we show a generalized framework to understand and reason...
Javed I. Khan, Sajid S. Shaikh
JC
2007
130views more  JC 2007»
13 years 7 months ago
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
Peter Scheiblechner
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...