947 search results - page 149 / 190 » Discrete Geometry |
166
click to vote
COMPGEOM
2009
ACM
16 years 15 days ago
2009
ACM
We present cache-oblivious solutions to two important variants of range searching: range reporting and approximate range counting. Our main contribution is a general approach for ...
139
click to vote
COMPGEOM
2000
ACM
15 years 10 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
170
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
145
click to vote
COMPGEOM
1996
ACM
15 years 10 months ago
1996
ACM
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
145
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...