Fast sequential and parallel algorithms for finding the largest rectangle separating two sets

DOI10.1080/00207169008803934zbMath0723.68103OpenAlexW2090015588WikidataQ126244790 ScholiaQ126244790MaRDI QIDQ3210919

No author found.

Publication date: 1990

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169008803934

zbMATH Keywords

systolic arrayCREW PRAMvery large scale integrationisothetic rectangleline sweep paradigmsingle data stream architectures

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Cites Work

• On the maximum empty rectangle problem
• A note on finding a maximum empty rectangle
• An efficient algorithm for maxdominance, with applications
• Learnability and the Vapnik-Chervonenkis dimension
• Computing the Largest Empty Rectangle
• Parallel Merge Sort
• Unnamed Item

This page was built for publication: Fast sequential and parallel algorithms for finding the largest rectangle separating two sets