Sciweavers

6274 search results - page 511 / 1255
» From query complexity to computational complexity
Sort
View
SIBGRAPI
2008
IEEE
16 years 1 months ago
Tradeoffs in Approximate Range Searching Made Simpler
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
403
Voted
NAR
2011
331views Computer Vision» more  NAR 2011»
15 years 1 months ago
Community cyberinfrastructure for Advanced Microbial Ecology Research and Analysis: the CAMERA resource
The Community Cyberinfrastructure for Advanced Microbial Ecology Research and Analysis (CAMERA, http://camera.calit2.net/) is a database and associated computational infrastructur...
Shulei Sun, Jing Chen, Weizhong Li, Ilkay Altintas...
SIGGRAPH
2000
ACM
15 years 11 months ago
Image-based visual hulls
In this paper, we describe an efficient image-based approach to computing and shading visual hulls from silhouette image data. Our algorithm takes advantage of epipolar geometry a...
Wojciech Matusik, Chris Buehler, Ramesh Raskar, St...
CA
1998
IEEE
15 years 11 months ago
Interactive Animation of Soft Shadows
Shadows are of great importance to computer graphics, especially for interactive animation due to the visual cues which they provide. Most research in the field of dynamic shadowi...
Adam D. Worrall, David Hedley, Derek J. Paddon
COMGEO
2006
ACM
15 years 7 months ago
Moving coins
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, an...
Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Al...