153 search results - page 28 / 31 » Near-linear approximation algorithms for geometric hitting s... |
153
click to vote
WSCG
2004
15 years 5 months ago
2004
Several sophisticated methods are available for efficient rendering of out-of-core terrain data sets. For huge data sets the use of preprocessed tiles has proven to be more effici...
149
Voted
IJCV
2006
15 years 3 months ago
2006
A new approach performing surface extraction from 3D images under user defined geometrical constraints is presented. The constraints are introduced through boundary curves given by...
121
Voted
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
140
Voted
APPROX
2006
Springer
15 years 7 months ago
2006
Springer
Motivated by applications in batch scheduling of jobs in manufacturing systems and distributed computing, we study two related problems. Given is a set of jobs {J1, . . . , Jn}, w...
156
click to vote
COMGEO
2008
ACM
15 years 3 months ago
2008
ACM
We consider algorithms for finding the optimal location of a simple transportation device, that we call a moving walkway, consisting of a pair of points in the plane between which ...