Fast parallel algorithms for the maximum empty rectangle problem.

DOI10.1007/BF02811344MaRDI QIDQ5955753zbMATH OpenOpenAlexFDO

Authors Amitava Datta, R. Srikant, G. D. S. Ramkumar, Kamala Krithivasan

Publication date 18 February 2002

Published in Sādhanā (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02811344, https://www.ias.ac.in/describe/article/sadh/017/01/0221-0236

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Cites work

• A new algorithm for the largest empty rectangle problem
• A note on finding a maximum empty rectangle
• An efficient algorithm for maxdominance, with applications
• Computing the Largest Empty Rectangle
• Efficient algorithms for the largest rectangle problem
• Geometric applications of a matrix-searching algorithm
• scientific article; zbMATH DE number 3858396 (Why is no real title available?)
• scientific article; zbMATH DE number 43583 (Why is no real title available?)
• scientific article; zbMATH DE number 3894498 (Why is no real title available?)
• On the maximum empty rectangle problem
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Parallel Merge Sort

This page was built for publication: Fast parallel algorithms for the maximum empty rectangle problem.

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