Sciweavers

2183 search results - page 87 / 437
» Multi-pass geometric algorithms
Sort
View
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
13 years 9 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
BMVC
2010
13 years 8 months ago
Object Detection with Geometrical Context Feedback Loop
We propose a new coherent framework for joint object detection, 3D layout estimation, and object supporting region segmentation from a single image. Our approach is based on the m...
Min Sun, Yingze Bao, Silvio Savarese
FOCS
2008
IEEE
14 years 4 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
MOBIHOC
2001
ACM
14 years 9 months ago
Geometric spanner for routing in mobile networks
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
14 years 2 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...