10608 search results - page 234 / 2122 » Complexity of O'Hara's Algorithm |
153
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
137
Voted
VAST
2004
ACM
2004
ACM
A Point-Based Approach for Capture, Display and Illustration of Very Complex Archeological Artefacts
15 years 9 months ago
In this paper we present a complete point-based pipeline for the capture, display and illustration of very large scans of archeological artifacts. This approach was developed as p...
176
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
135
click to vote
COSIT
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
135
click to vote
SIGGRAPH
1992
ACM
15 years 8 months ago
1992
ACM
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...