61 search results - page 6 / 13 » Pointed binary encompassing trees: Simple and optimal |
COMPGEOM
2004
ACM
14 years 28 days ago
2004
ACM
Let P be a simple polygon with m vertices, k of which are reflex, and which contains r red points and b blue points in its interior. Let n = m + r + b. A ham-sandwich geodesic is ...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
PPSC
2001
13 years 9 months ago
2001
As the gap between processor and memory performance widens, careful analyses and optimizations of cache memory behavior become increasingly important. While analysis of regular lo...
ICRA
2002
IEEE
14 years 13 days ago
2002
IEEE
Effective image segmentation of a digitized scene into a set of recognizable objects requires the development of sophisticated scene analysis algorithms. Progress in this area has...
ALGORITHMICA
2010
13 years 7 months ago
2010
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...