Mar 23, 2018 · We develop both multi-level tree structures and sweepline algorithms supporting range, segment and rectangle queries in two dimensions.

Based on the augmented map interface, we develop both multi-level tree structures and sweepline algorithms supporting range, segment and rectangle queries in ...

The support of range, segment and rectangle queries are fundamental problems in computational geometry, and have extensive applications in many domains.

This work proposes to use a simple framework (the augmented map) to model the range, segment and rectangle query problems, and develops both multi-level ...

In this paper, we focus on simple and efficient parallel algorithms and implementations for range, segment and rectangle queries, which have tight worst-case ...

In this paper we focus on simple and efficient parallel algorithms and implementations for range and segment queries. We propose using a simple framework (the ...

PaC-trees achieve better performance than P-trees for both queries, being 1.16x faster for Q-Sum and 1.96x faster for Q-All queries, likely due to requiring ...

In this paper we focus on simple and efficient parallel algorithms and implementations for range and segment queries. We propose using a simple framework (the ...

PAM (Parallel Augmented Maps). A Parallel C++ Library for Balanced Binary Trees. Supports efficient parallel (augmented) balanced binary trees.

An interface for ordered maps that is augmented to support fast range queries and sums, and a parallel and concurrent library called PAM (Parallel Augmented ...