@inproceedings{4731b87027cc4ef895f71f4af6b59636,

title = "On overlays and minimization diagrams",

abstract = "The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in ℝd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in ℝd+m-1, This elementary observation leads to a new bound on the complexity of the overlay of minimization diagrams of collections of d-variate semi-algebraic surfaces, a tight bound on the complexity of the overlay of minimization diagrams of collections of hyperplanes, and faster algorithms for constructing such overlays. Further algorithmic implications are discussed.",

keywords = "Arrangements, Hyperplanes, Lower envelopes, Minimization diagrams, Overlays, Power diagrams, Voronoi diagrams",

author = "Vladlen Koltun and Micha Sharir",

year = "2006",

doi = "10.1145/1137856.1137914",

language = "אנגלית",

isbn = "1595933409",

series = "Proceedings of the Annual Symposium on Computational Geometry",

publisher = "Association for Computing Machinery (ACM)",

pages = "395--401",

booktitle = "Proceedings of the Twenty-Second Annual Symposium on Computational Geometry 2006, SCG'06",

address = "ארצות הברית",

note = "22nd Annual Symposium on Computational Geometry 2006, SCG'06 ; Conference date: 05-06-2006 Through 07-06-2006",

}