RED-BLUE SEPARABILITY PROBLEMS IN 3D

DOI10.1142/S0218195905001646zbMath1067.68160MaRDI QIDQ5311632

Saurabh Sethia, Carlos Seara, Ferran Hurtado

Publication date: 23 August 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

boxprismpyramidslabwedgetetrahedrondouble wedgeSeparability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Dynamic minimum bichromatic separating circle, Separating bichromatic point sets in the plane by restricted orientation convex hulls

Cites Work

• Algorithms for weak and wide separation of sets
• Minimum polygonal separation
• The common exterior of convex polygons in the plane
• Separability by two lines and by nearly straight polygonal chains
• Red-Blue Separability Problems in 3D
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Computing the width of a set
• An optimal algorithm for intersecting line segments in the plane
• The Union of Convex Polyhedra in Three Dimensions
• Separating objects in the plane by wedges and strips