Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle

DOI10.1142/S0129054117500198zbMath1372.68268MaRDI QIDQ5357503

Zahra Moslehi, Alireza Bagheri

Publication date: 8 September 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

trianglecomputational geometrypoint setenclosing problembichromaticseparability problem

Mathematics Subject Classification ID

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

Related Items (1)

Separating bichromatic point sets in the plane by restricted orientation convex hulls

Cites Work

• Minimum-area enclosing triangle with a fixed angle
• Minimum polygonal separation
• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Finding the smallest triangles containing a given convex polygon
• An optimal algorithm for finding minimal enclosing triangles
• SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS
• Discrete and Computational Geometry

This page was built for publication: Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle