Sciweavers

19 search results - page 2 / 4
» Orthogonal Range Reporting in Three and Higher Dimensions
Sort
View
COMPGEOM
2009
ACM
14 years 23 hour ago
Cache-oblivious range reporting with optimal queries requires superlinear space
We consider a number of range reporting problems in two and three dimensions and prove lower bounds on the amount of space used by any cache-oblivious data structure for these pro...
Peyman Afshani, Chris H. Hamilton, Norbert Zeh
COMPGEOM
2011
ACM
12 years 9 months ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan
ORDER
2008
100views more  ORDER 2008»
13 years 5 months ago
Orthogonal Surfaces and Their CP-Orders
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthog...
Stefan Felsner, Sarah Kappes
PAMI
2011
12 years 8 months ago
Higher-Dimensional Affine Registration and Vision Applications
—Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in IR2 and IR3 . This...
S. M. Nejhum Shahed, Yu-Tseh Chi, Jeffrey Ho, Ming...
STACS
2012
Springer
12 years 1 months ago
Linear-Space Data Structures for Range Mode Query in Arrays
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
Timothy M. Chan, Stephane Durocher, Kasper Green L...