Sciweavers

102 search results - page 19 / 21
» Improved Bounds for Geometric Permutations
Sort
View
SGP
2003
14 years 11 months ago
CLODs: Dual Hierarchies for Multiresolution Collision Detection
We present “contact levels of detail” (CLOD), a novel concept for multiresolution collision detection. Given a polyhedral model, our algorithm automatically builds a “dual h...
Miguel A. Otaduy, Ming C. Lin
VCIP
2000
148views Communications» more  VCIP 2000»
14 years 10 months ago
Aircraft recognition and pose estimation
This work presents a geometry based vision system for aircraft recognition and pose estimation using single images. Pose estimation improves the tracking performance of guided wea...
Hatem Hmam, Jijoong Kim
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
15 years 3 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
TMC
2011
131views more  TMC 2011»
14 years 4 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
COMGEO
2010
ACM
14 years 9 months ago
Exact join detection for convex polyhedra and other numerical abstractions
r Numerical Abstractions6 Roberto Bagnaraa , Patricia M. Hillb , Enea Zaffanellaa aDepartment of Mathematics, University of Parma, Italy bSchool of Computing, University of Leeds, ...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella