IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS

DOI10.1142/S0218195993000087MaRDI QIDQ3136720zbMATH OpenFDO

Authors Yishay Mansour, James K. Park, Baruch Schieber, Sandeep Sen

Publication date 24 October 1993

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

convex polygonsMonge arraysplanar distance selection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Selection and sorting in totally monotone arrays
• Selection in \(X+Y\) and matrices with sorted rows and columns
• Selection in Monotone Matrices and Computingkth Nearest Neighbors
• Selection in monotone matrices and computing k th nearest neighbors
• Geometric applications of a matrix-searching algorithm

Cited in

(6)

• scientific article; zbMATH DE number 742987 (Why is no real title available?)
• Selection in monotone matrices and computing k th nearest neighbors
• Selection in Monotone Matrices and Computingkth Nearest Neighbors
• Perspectives of Monge properties in optimization
• Searching monotone multi-dimensional arrays
• Selection and sorting in totally monotone arrays

This page was built for publication: IMPROVED SELECTION IN TOTALLY MONOTONE ARRAYS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136720)