Sharif University of TechnologyScientia Iranica1026-309829520221001Separating bichromatic polylines by fixed-angle minimal triangles240524172276110.24200/sci.2022.59206.6108ENM. Hosseinzadeh MoghaddamDepartment of Computer Engineering, North Tehran Branch, Islamic Azad University, Tehran, IranA. BagheriDepartment of Computer Engineering, Amirkabir University of Technology, Tehran, Iran0000-0002-3542-7763Journal Article20211007Separation of desired objects from undesired ones is one of the most important issues in the computational geometry. It is tended to cover the desired objects by one or a couple of geometric shapes in a way that all of the desired objects are included by the covering shapes, while the undesired objects are excluded. We study separation of polylines by minimal triangles with a given fixed angle and present O(N log N)-time algorithm, where N is the number of all the desired and undesired polylines. By a minimal triangle, we mean a triangle in which all of its edges are tangential to the convex hull of the desired polylines. The motivation for studying this separation problem stems from that we need to separate bichromatic objects that are modeled by polylines not points in real life scenarios.https://scientiairanica.sharif.edu/article_22761_8324851c0b8840871767de7336eb9bcd.pdf