Sciweavers

824 search results - page 20 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
SIGMETRICS
2008
ACM
13 years 7 months ago
Network distance estimation with dynamic landmark triangles
This paper describes an efficient and accurate approach to estimate the network distance between arbitrary Internet hosts. We use three landmark hosts forming a triangle in two-di...
Zhihua Wen, Michael Rabinovich
SMA
2008
ACM
203views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Interactive continuous collision detection between deformable models using connectivity-based culling
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manoc...
GI
2009
Springer
13 years 5 months ago
An Automotive Perception System using Distance Cameras and Polar Occupancy Grids
Abstract: One of the basic tasks of automotive collision avoidance and collision mitigation systems is the robust and reliable detection of objects as well as the prediction of fut...
Norman Mattern, Robin Schubert, Christian Adam, Ge...
ADCM
2007
100views more  ADCM 2007»
13 years 8 months ago
An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphi
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...
Evgeny Lipovetsky, Nira Dyn
TSMC
2010
13 years 2 months ago
Distance Approximating Dimension Reduction of Riemannian Manifolds
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
Changyou Chen, Junping Zhang, Rudolf Fleischer