Sciweavers

177 search results - page 3 / 36
» Geometric Applications of a Randomized Optimization Techniqu...
Sort
View
SODA
2004
ACM
127views Algorithms» more  SODA 2004»
13 years 7 months ago
An optimal randomized algorithm for maximum Tukey depth
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
Timothy M. Chan
SPAA
2005
ACM
13 years 11 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
SODA
2003
ACM
131views Algorithms» more  SODA 2003»
13 years 7 months ago
Root comparison techniques applied to computing the additively weighted Voronoi diagram
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
Menelaos I. Karavelas, Ioannis Z. Emiris
CVPR
2007
IEEE
14 years 7 months ago
Seamless Mosaicing of Image-Based Texture Maps
Image-based object modeling has emerged as an important computer vision application. Typically, the process starts with the acquisition of the image views of an object. These view...
Victor S. Lempitsky, Denis V. Ivanov
STACS
1999
Springer
13 years 9 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin