Let V be a finite set of points in the plane. We present a 2-local algorithm that constructs a plane 4 3 9 -spanner of the unit-disk graph UDG(V ). This algorithm makes only one ...
Prosenjit Bose, Paz Carmi, Michiel H. M. Smid, Dam...
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Mil...
nce Abstract) 1 GAUTAM DAS - University of Wisconsin DEBORAH JOSEPH - University of Wisconsin Chew and Dobkin et. al. have shown that the Delaunay triangulation and its variants ar...
We describe a novel Geometric Localized Routing (GLR) protocol in Disruption (Delay) Tolerant Network (DTN). Although DTNs do not guarantee the connectivity of the network all the...
This paper describes a method for establishing dense correspondence between two images in a video sequence (motion) or in a stereo pair (disparity) in case of large displacements....
Moustapha Kardouchi, Janusz Konrad, Carlos V&aacut...