Sciweavers

824 search results - page 56 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
14 years 2 months ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer
DASFAA
2010
IEEE
129views Database» more  DASFAA 2010»
14 years 12 days ago
Efficient Approximate Visibility Query in Large Dynamic Environments
Abstract. Visibility query is fundamental to many analysis and decisionmaking tasks in virtual environments. Visibility computation is time complex and the complexity escalates in ...
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shaha...
ICIP
2004
IEEE
14 years 9 months ago
Morphological gradient operators for colour images
A new morphological gradient operator for colour images is introduced that can be viewed as a direct extension of the well known morphological gradient. In this approach, each pix...
Adrian N. Evans
VIS
2007
IEEE
235views Visualization» more  VIS 2007»
14 years 9 months ago
Efficient Surface Reconstruction using Generalized Coulomb Potentials
We propose a novel, geometrically adaptive method for surface reconstruction from noisy and sparse point clouds, without orientation information. The method employs a fast convecti...
Andrei C. Jalba, Jos B. T. M. Roerdink
ICCV
2005
IEEE
14 years 10 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon