{"_id":"4108","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"last_name":"Seidel","full_name":"Seidel, Raimund","first_name":"Raimund"}],"acknowledgement":"We would like to thank John Gilbert for his careful reading of the manuscript and his many suggestions for improvement. We also want to thank Bennett Battaile, Gianfranco Bilardi, Joseph O'Rourke, and Chee Yap for their comments. ","intvolume":"         1","extern":"1","quality_controlled":"1","publication_status":"published","doi":"10.1007/BF02187681","page":"25 - 44","article_processing_charge":"No","title":"Voronoi diagrams and arrangements","month":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","issue":"1","date_created":"2018-12-11T12:06:59Z","language":[{"iso":"eng"}],"type":"journal_article","abstract":[{"text":"We propose a uniform and general framework for defining and dealing with Voronoi diagrams. In this framework a Voronoi diagram is a partition of a domainD induced by a finite number of real valued functions onD. Valuable insight can be gained when one considers how these real valued functions partitionD ×R. With this view it turns out that the standard Euclidean Voronoi diagram of point sets inR d along with its order-k generalizations are intimately related to certain arrangements of hyperplanes. This fact can be used to obtain new Voronoi diagram algorithms. We also discuss how the formalism of arrangements can be used to solve certain intersection and union problems.","lang":"eng"}],"publist_id":"2012","citation":{"chicago":"Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF02187681\">https://doi.org/10.1007/BF02187681</a>.","apa":"Edelsbrunner, H., &#38; Seidel, R. (1986). Voronoi diagrams and arrangements. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187681\">https://doi.org/10.1007/BF02187681</a>","short":"H. Edelsbrunner, R. Seidel, Discrete &#38; Computational Geometry 1 (1986) 25–44.","mla":"Edelsbrunner, Herbert, and Raimund Seidel. “Voronoi Diagrams and Arrangements.” <i>Discrete &#38; Computational Geometry</i>, vol. 1, no. 1, Springer, 1986, pp. 25–44, doi:<a href=\"https://doi.org/10.1007/BF02187681\">10.1007/BF02187681</a>.","ama":"Edelsbrunner H, Seidel R. Voronoi diagrams and arrangements. <i>Discrete &#38; Computational Geometry</i>. 1986;1(1):25-44. doi:<a href=\"https://doi.org/10.1007/BF02187681\">10.1007/BF02187681</a>","ista":"Edelsbrunner H, Seidel R. 1986. Voronoi diagrams and arrangements. Discrete &#38; Computational Geometry. 1(1), 25–44.","ieee":"H. Edelsbrunner and R. Seidel, “Voronoi diagrams and arrangements,” <i>Discrete &#38; Computational Geometry</i>, vol. 1, no. 1. Springer, pp. 25–44, 1986."},"oa_version":"None","date_published":"1986-01-01T00:00:00Z","volume":1,"year":"1986","day":"01","status":"public","publisher":"Springer","article_type":"original","date_updated":"2022-02-01T08:53:39Z","publication":"Discrete & Computational Geometry"}