Dynamic ham-sandwich cuts in the plane

Dynamic ham-sandwich cuts in the plane

We design efficient data structures for dynamically maintaining a ham-sandwich cut of two point sets in the plane subject to insertions and deletions of points in either set. A ham-sandwich cut is a line that simultaneously bisects the cardinality of both point sets. For general point sets, our firs...

Full description

Bibliographic Details
Main Authors: Abbott, Timothy G. (Contributor), Burr, Michael A. (Author), Chan, Timothy M. (Author), Demaine, Erik D. (Contributor), Demaine, Martin L. (Contributor), Hugg, John (Author), Kane, Daniel (Author), Langerman, Stefan (Author), Nelson, Jelani (Contributor), Rafalin, Eynat (Author), Seyboth, Kathryn (Author), Yeung, Vincent (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor)
Format: Article
Language:English
Published: Elsevier, 2015-03-25T18:34:46Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items