TY - JOUR
ID - 22761
TI - Separating bichromatic polylines by fixed-angle minimal triangles
JO - Scientia Iranica
JA - SCI
LA - en
SN - 1026-3098
AU - Hosseinzadeh Moghaddam, M.
AU - Bagheri, A.
AD - Department of Computer Engineering, North Tehran Branch, Islamic Azad University, Tehran, Iran
AD - Department of Computer Engineering, Amirkabir University of Technology, Tehran, Iran
Y1 - 2022
PY - 2022
VL - 29
IS - 5
SP - 2405
EP - 2417
KW - Computational geometry
KW - bichromatic separation
KW - minimal triangle
KW - polyline separation
KW - fixed-angle triangle
DO - 10.24200/sci.2022.59206.6108
N2 - Separation 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.
UR - https://scientiairanica.sharif.edu/article_22761.html
L1 - https://scientiairanica.sharif.edu/article_22761_8324851c0b8840871767de7336eb9bcd.pdf
ER -