2 citations · 3 across the 5 of their papers we have counts for
Showing cs.CGShow 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…
cs.CG2007★ 1 cited
Spanners of Complete -Partite Geometric Graphs
Prosenjit Bose, Paz Carmi, Mathieu Couture +3
We address the following problem: Given a complete -partite geometric graph whose vertex set is a set of points in , compute a spanner of that has a ``…