49 search results - page 3 / 10 » Lower bounds for expected-case planar point location |
APVIS
2007
13 years 9 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we sh...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that support geometric queries in optimal time, by taking adv...
CCCG
2010
13 years 9 months ago
2010
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
ALENEX
2007
13 years 9 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...