Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"range successor"”.

  1. Three Approaches to Building Time-Windowed Geometric Data Structures

    … closest pair decision problem to 2D dominance range emptiness using grids to compute candidate satisfying pairs. We extend this approach to find the closest pair of points by reducing the problem to 2D dominance range minimum, which we further reduce to 2D point location. Our second approach is …

    waterloo Repository record for Three Approaches to Building Time-Windowed Geometric Data Structures (opens in a new tab)

  2. Three-Sided Skyline Counting Queries

    … queries in the special case when the query range is bounded on three sides. First, we describe a linear space data structure that counts the points on the skyline of a top-open three-sided query range in O(log log n) time. We also consider a variation of the skyline problem where each of the …

    mtu Repository record for Three-Sided Skyline Counting Queries (opens in a new tab)