Maximal empty coboids among points and blocks

DOI10.1016/S0898-1221(98)00125-4zbMATH Open0939.68145MaRDI QIDQ1806576FDOQ1806576

Yanyan Li

Publication date: 8 November 1999

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

zbMATH Keywords

maximal empty isothetic cuboids

Mathematics Subject Classification ID

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

Cites Work

• Computing the Largest Empty Rectangle
• A new algorithm for the largest empty rectangle problem
• On the maximum empty rectangle problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

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

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Maximal Empty Boxes Amidst Random Points 👍 👎

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)