scientific article; zbMATH DE number 4213450

MaRDI QIDQ3359760zbMATH OpenFDO

Authors Fabrizio d'Amore, Paolo G. Franciosa

Publication date 1990

zbMATH Keywords

cutting hyperplanehyperrectanglesmanagement of spatial objectsseparating

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• SEPARATING SETS OF HYPERRECTANGLES
• Cutting hyperplanes for divide-and-conquer
• On optimal cuts of hyperrectangles
• Separating collections of points in Euclidean spaces
• Algorithms for ham-sandwich cuts

Cited in

(8)

• Partitioning and separating sets of orthogonal polygons
• Cutting glass
• On optimal cuts of hyperrectangles
• SEPARATING SETS OF HYPERRECTANGLES
• Fast sequential and parallel algorithms for finding the largest rectangle separating two sets
• scientific article; zbMATH DE number 1760038 (Why is no real title available?)
• scientific article; zbMATH DE number 759640 (Why is no real title available?)
• Separating collections of points in Euclidean spaces

This page was built for publication:

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