Sciweavers

148 search results - page 3 / 30
» On the extender algebra being complete
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Complete subdivision algorithms, I: intersection of Bezier curves
We give the first complete subdivision algorithm for the intersection of two Bezier curves F, G, possibly with tangential intersections. Our approach to robust subdivision algori...
Chee-Keng Yap
ENTCS
2008
81views more  ENTCS 2008»
13 years 7 months ago
Presenting Dcpos and Dcpo Algebras
Dcpos can be presented by a preorder of generators and inequational relations expressed as covers. Algebraic operations on the generators (possibly with their results being ideals...
Achim Jung, M. Andrew Moshier, Steven J. Vickers
IJRR
2002
87views more  IJRR 2002»
13 years 7 months ago
Complete Path Planning for Closed Kinematic Chains with Spherical Joints
We study the path planning problem, without obstacles, for closed kinematic chains with n links connected by spherical joints in space or revolute joints in the plane. The configu...
Jeffrey C. Trinkle, R. James Milgram
FQAS
1998
Springer
133views Database» more  FQAS 1998»
13 years 11 months ago
Estimating the Quality of Databases
Abstract. With more and more electronic information sources becoming widely available, the issue of the quality of these often-competing sources has become germane. We propose a st...
Amihai Motro, Igor Rakov
CALCO
2009
Springer
133views Mathematics» more  CALCO 2009»
14 years 2 months ago
Stone Duality and the Recognisable Languages over an Algebra
Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic a...
Mai Gehrke