On computing the maximum-volume bichromatic separating box

DOI10.1016/J.TCS.2025.115593MaRDI QIDQ6891666zbMATH OpenFDO

Authors Bogdan Armaselu

Publication date 2 December 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115593

zbMATH Keywords

boxseparabilityarbitrary orientationbichromaticaxis-alignedmaximum-volume

Mathematics Subject Classification ID

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

Cites work

• A linear algorithm for determining the separation of convex polyhedra
• COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS
• Computing circular separability
• Computing the Largest Empty Rectangle
• Dynamic minimum bichromatic separating circle
• Finding the largest separating rectangle among two point sets
• Geometric applications of a matrix-searching algorithm
• Kinetic red-blue minimum separating circle
• Largest empty rectangle among a point set
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Low-Dimensional Linear Programming with Violations
• Maximal empty coboids among points and blocks
• On Computing a Largest Empty Arbitrarily Oriented Rectangle
• On the maximum empty rectangle problem
• Polynomial time algorithms for bichromatic problems
• RED-BLUE SEPARABILITY PROBLEMS IN 3D
• SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• Separability by two lines and by nearly straight polygonal chains
• Separating objects in the plane by wedges and strips
• Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications

This page was built for publication: On computing the maximum-volume bichromatic separating box

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