Fast parallel algorithms for the maximum empty rectangle problem.

DOI10.1007/BF02811344zbMath1075.68662OpenAlexW2063306850MaRDI QIDQ5955753

No author found.

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

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
• On the maximum empty rectangle problem
• A note on finding a maximum empty rectangle
• Geometric applications of a matrix-searching algorithm
• An efficient algorithm for maxdominance, with applications
• Efficient algorithms for the largest rectangle problem
• Computing the Largest Empty Rectangle
• Parallel Merge Sort
• Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
• Unnamed Item
• Unnamed Item
• Unnamed Item

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