698 search results - page 16 / 140 » On rationally supported surfaces |
ICRA
2009
IEEE
14 years 2 months ago
2009
IEEE
— We present a new type of oriented bounding surfaces, which is particularly well suited for shortest distance computations. The bounding surfaces are obtained by considering sur...
COMPGEOM
2003
ACM
14 years 19 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
SYNTHESE
2010
13 years 5 months ago
2010
In the Newcomb problem, the standard arguments for taking either one box or both boxes adduce what seem to be relevant considerations, but they are not complete arguments, and att...
CAD
2006
Springer
13 years 7 months ago
2006
Springer
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
CGF
2008
13 years 7 months ago
2008
We present a system for creating and manipulating layered procedural surface editing operations, which is motivated by the limited support for iterative design in free-form modeli...