scientific article; zbMATH DE number 1182924

zbMath0907.68197MaRDI QIDQ4401021

Pankaj K. Agarwal

Publication date: 2 March 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

intersection-searching problemsrange-searching data structures

Mathematics Subject Classification ID

Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items (13)

Higher order Delaunay triangulations ⋮ On the stabbing number of a random Delaunay triangulation ⋮ Finding top-\(k\) longest palindromes in substrings ⋮ Simplex Range Searching and Its Variants: A Review ⋮ On simplifying dot maps. ⋮ On Dominance Reporting in 3D ⋮ Constrained higher order Delaunay triangulations ⋮ The Orthant Neighborhood Graph: A Decentralized Spatial Data Structure for Dynamic Point Sets ⋮ Unnamed Item ⋮ A New Lower Bound for Semigroup Orthogonal Range Searching ⋮ Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model ⋮ Orthogonal Range Searching for Text Indexing ⋮ Chaining algorithms for multiple genome comparison

This page was built for publication: