6300 search results - page 157 / 1260 » We have it easy, but do we have it right |
120
click to vote
ISTA
2003
15 years 2 months ago
2003
: With the increasing amount of information available on the Internet one of the most challenging tasks is to provide search interfaces that are easy to use without having to learn...
127
click to vote
VMV
2003
15 years 2 months ago
2003
We present a new algorithm for the computation of volumetric intersections of geometrically complex objects, which can be used for the efficient detection of collisions. Our appr...
CORR
2006
Springer
15 years 1 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
129
click to vote
CAD
2005
Springer
15 years 1 months ago
2005
Springer
For generalized cylinders (GC) defined by contours of discrete curves, we propose two algorithms to generate GC surfaces (1) in polygonal meshes and (2) in cylindrical type of dev...
104
click to vote
CGF
2004
15 years 1 months ago
2004
We present a novel clustering algorithm for polygonal meshes which approximates a Centroidal Voronoi Diagram construction. The clustering provides an efficient way to construct un...