Selection in monotone matrices and computing k th nearest neighbors

DOI10.1007/3-540-58218-5_2zbMath1502.68295OpenAlexW1754476973MaRDI QIDQ5056162

Sandeep Sen, Pankaj K. Agarwal

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58218-5_2

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Perspectives of Monge properties in optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the longest diagonal of a simple polygon
• Geometric applications of a matrix-searching algorithm
• An O(n log n) algorithm for the all-nearest-neighbors problem
• Time bounds for selection
• Selecting distances in the plane
• IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS
• Ray Shooting and Parametric Search
• Generalized Selection and Ranking: Sorted Matrices
• New upper bounds for neighbor searching
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Selection and sorting in totally monotone arrays
• Good splitters for counting points in triangles
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• Improved Algorithms for Economic Lot Size Problems
• On range searching with semialgebraic sets