49 search results - page 4 / 10 » Lower bounds for expected-case planar point location |
GD
1997
Springer
14 years 11 hour ago
1997
Springer
d Abstract) In this paper, we investigate area requirements for drawing s-t hierarchically planar graphs by straight-lines. Two drawing standards will be discussed: 1) each vertex ...
ALGORITHMICA
2004
13 years 7 months ago
2004
We apply and extend the priority algorithm framework introduced by Borodin, Nielsen, and Rackoff to define "greedy-like" algorithms for the (uncapacitated) facility locat...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Tracking in a multipath environment poses many challenges. It is worth while to quantify the achievable performance bounds in such an environment. However finding the performance...
COMPGEOM
2010
ACM
14 years 28 days ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
JCO
2010
13 years 6 months ago
2010
We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in tria...