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., Burr, Michael A., Chan, Timothy M., Demaine, Erik D., Demaine, Martin L., Hugg, John, Kane, Daniel, Langerman, Stefan, Nelson, Jelani, Rafalin, Eynat, Seyboth, Kathryn, Yeung, Vincent
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Elsevier 2015
Online Access:http://hdl.handle.net/1721.1/96191
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/96191
https://orcid.org/0000-0003-3803-5703

Similar Items