Abstract
Dujmović and Langerman (2013) proved a ham-sandwich cut theorem for an arrangement of lines in the plane. Recently, Xue and Soberón (2019) generalized it to balanced convex partitions of lines in the plane. In this paper, we study the computational problems of computing a ham-sandwich cut balanced convex partitions for an arrangement of lines in the plane. We show that both problems can be solved in polynomial time.
Author supplied keywords
Cite
CITATION STYLE
Bereg, S. (2020). Computing Balanced Convex Partitions of Lines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12118 LNCS, pp. 247–257). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61792-9_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
