Finding Nearest Larger Neighbors

DOI10.1007/978-3-642-03456-5_17zbMath1258.68178OpenAlexW45697247MaRDI QIDQ3644726

Sergey Bereg, Tetsuo Asano, David G. Kirkpatrick

Publication date: 12 November 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03456-5_17

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01)

Related Items (6)

Space efficient data structures for nearest larger neighbor ⋮ Encoding Nearest Larger Values ⋮ Space Efficient Data Structures for Nearest Larger Neighbor ⋮ Encoding nearest larger values ⋮ A new algorithmic framework for basic problems on binary images ⋮ In-place algorithm for erasing a connected component in a binary image

This page was built for publication: Finding Nearest Larger Neighbors