Sciweavers

78 search results - page 14 / 16
» An introduction to line geometry with applications
Sort
View
CEC
2010
IEEE
13 years 8 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius
ICCV
1999
IEEE
14 years 9 months ago
Stereo Reconstruction from Multiperspective Panoramas
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
Heung-Yeung Shum, Richard Szeliski
COMPGEOM
2010
ACM
14 years 20 days ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
SIGGRAPH
1997
ACM
13 years 11 months ago
Interactive update of global illumination using a line-space hierarchy
Interactively manipulating the geometry of complex, globally illuminated scenes has to date proven an elusive goal. Previous attempts have failed to provide interactive updates of...
George Drettakis, François X. Sillion
CGA
2008
13 years 7 months ago
Interactive Reconfiguration of Urban Layouts
The ability to create and edit a model of a large-scale city is necessary for a variety of applications such as web-based navigation (e.g., MapQuest, GoogleEarth), emergency respo...
Daniel G. Aliaga, Bedrich Benes, Carlos A. Vanegas...