Maximal empty coboids among points and blocks

DOI10.1016/S0898-1221(98)00125-4MaRDI QIDQ1806576zbMATH OpenFDO

Authors Yanyan Li

Publication date 8 November 1999

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(98)00125-4

zbMATH Keywords

maximal empty isothetic cuboids

Mathematics Subject Classification ID

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

Recommendations

• On the Number of Maximum Empty Boxes Amidst n Points
• An efficient algorithm for computing the maximum empty rectangle in three dimensions
• On the number of maximum empty boxes amidst \(n\) points
• scientific article; zbMATH DE number 4178817
• Maximal Empty Boxes Amidst Random Points

Cites work

• A new algorithm for the largest empty rectangle problem
• Computing the Largest Empty Rectangle
• scientific article; zbMATH DE number 4213497 (Why is no real title available?)
• scientific article; zbMATH DE number 4062042 (Why is no real title available?)
• scientific article; zbMATH DE number 2077118 (Why is no real title available?)
• On the maximum empty rectangle problem

Cited in

(5)

• On the number of maximum empty boxes amidst \(n\) points
• Variations of largest rectangle recognition amidst a bichromatic point set
• An efficient algorithm for computing the maximum empty rectangle in three dimensions
• Finding the largest separating rectangle among two point sets
• On computing the maximum-volume bichromatic separating box

This page was built for publication: Maximal empty coboids among points and blocks

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