Sciweavers

10988 search results - page 306 / 2198
» Algorithmic Folding Complexity
Sort
View
VAST
2004
ACM
15 years 10 months ago
A Point-Based Approach for Capture, Display and Illustration of Very Complex Archeological Artefacts
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...
Florent Duguet, George Drettakis, Daniel Girardeau...
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
15 years 9 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
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 ...
Shmuel Safra, Oded Schwartz
COSIT
2001
Springer
158views GIS» more  COSIT 2001»
15 years 9 months ago
Double-Crossing: Decidability and Computational Complexity of a Qualitative Calculus for Navigation
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...
Alexander Scivos, Bernhard Nebel
SIGGRAPH
1992
ACM
15 years 8 months ago
Predicting reflectance functions from complex surfaces
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
Stephen H. Westin, James Arvo, Kenneth E. Torrance
3DIM
2001
IEEE
15 years 8 months ago
Reconstruction of Complex Environments by Robust Pre-aligned ICP
This paper proposes a technique for three-dimensional reconstruction of an underwater environment from range views acquired by an acoustic camera. The final target of the work lie...
Vittorio Murino, Lucca Ronchetti, Umberto Castella...