73 citations · 387 across the 61 of their papers we have counts for
Showing 2008Show all
3 papers · 1 filter
cs.CG2008
Biased Range Trees
Vida Dujmovic, John Howat, Pat Morin
A data structure, called a biased range tree, is presented that preprocesses a set S of n points in R^2 and a query distribution D for 2-sided orthogonal range counting queries. Th…
cs.CG2008
Succinct Geometric Indexes Supporting Point Location Queries
Prosenjit Bose, Eric Y. Chen, Meng He +2
We propose to design data structures called succinct geometric indexes of negligible space (more precisely, o(n) bits) that, by taking advantage of the n points in the data set per…
math.CO2008
Distinct Distances in Graph Drawings
Paz Carmi, Vida Dujmović, Pat Morin +1
The \emph{distance-number} of a graph is the minimum number of distinct edge-lengths over all straight-line drawings of in the plane. This definition generalises many well-…