226 search results - page 36 / 46 » Approximation algorithm for the kinetic robust K-center prob... |
TASE
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—A fast offset surface generation approach is presented in this paper to construct intersection-free offset surfaces, which preserve sharp features, from freeform triangu...
SIGGRAPH
1992
ACM
14 years 16 hour ago
1992
ACM
This paper discusses how interval analysis can be used to solve a wide variety of problems in computer graphics. These problems include ray tracing, interference detection, polygo...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we investigate the usage of persistent point feature histograms for the problem of aligning point cloud data views into a consistent global model. Given a collect...
IMR
2004
Springer
14 years 1 months ago
2004
Springer
Sweep method is one of the most robust techniques to generate hexahedral meshes in extrusion volumes. One of the main issues to be dealt by any sweep algorithm is the projection o...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...