10 search results - page 1 / 2 » On the Range Maximum-Sum Segment Query Problem |
12
Voted
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
COMPGEOM
2011
ACM
12 years 8 months ago
2011
ACM
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...
SODA
2008
ACM
13 years 6 months ago
2008
ACM
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amo...
COMPGEOM
2001
ACM
13 years 8 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
GIS
2005
ACM
14 years 5 months ago
2005
ACM
Databases of moving objects are important for air traffic control, ground traffic, and battlefield configurations. We introduce the (historical and spatial) range close-pair query...