Sciweavers

824 search results - page 128 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
SODA
1992
ACM
135views Algorithms» more  SODA 1992»
13 years 9 months ago
Applications of Parametric Searching in Geometric Optimization
We present several applications in computational geometry of Megiddo's parametric searching technique. These applications include: (1) Finding the minimum Hausdorff distance ...
Pankaj K. Agarwal, Micha Sharir, Sivan Toledo
POPL
2007
ACM
14 years 8 months ago
Cork: dynamic memory leak detection for garbage-collected languages
A memory leak in a garbage-collected program occurs when the program inadvertently maintains references to objects that it no longer needs. Memory leaks cause systematic heap grow...
Maria Jump, Kathryn S. McKinley
ICCV
2007
IEEE
14 years 9 months ago
A systematic approach for 2D-image to 3D-range registration in urban environments
The photorealistic modeling of large-scale objects, such as urban scenes, requires the combination of range sensing technology and digital photography. In this paper, we attack th...
Lingyun Liu, Ioannis Stamos
MOBIHOC
2001
ACM
14 years 7 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 ...
MOBICOM
2005
ACM
14 years 1 months ago
Experimental characterization of multi-hop communications in vehicular ad hoc network
This paper presents the performance measurement of TCP and UDP communication of a multi-hop Vehicular Ad Hoc Network (VANET) in highway and suburban areas. We use existing out-ofb...
Fay Hui, Prasant Mohapatra