[{"language":[{"iso":"eng"}],"title":"Ham-sandwich theorems applied to intersection problems","publisher":"Teubner","date_published":"1984-01-01T00:00:00Z","year":"1984","month":"01","date_created":"2018-12-11T12:03:43Z","conference":{"name":"WG: International Workshop on Graph Theoretic Concepts in Computer Science","location":"Haus Ohrbeck, Germany"},"main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1984-P-06-HamSandwichTheorems.pdf"}],"author":[{"first_name":"David","last_name":"Dobkin","full_name":"Dobkin, David"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"}],"status":"public","series_title":"WG","type":"conference","day":"01","citation":{"short":"D. Dobkin, H. Edelsbrunner, in:, 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 88–99.","ista":"Dobkin D, Edelsbrunner H. 1984. Ham-sandwich theorems applied to intersection problems. 9th International Workshop on Graph Theoretic Concepts in Computer Science. WG: International Workshop on Graph Theoretic Concepts in Computer ScienceWG, 88–99.","ama":"Dobkin D, Edelsbrunner H. Ham-sandwich theorems applied to intersection problems. In: <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>. WG. Teubner; 1984:88-99.","mla":"Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>, Teubner, 1984, pp. 88–99.","chicago":"Dobkin, David, and Herbert Edelsbrunner. “Ham-Sandwich Theorems Applied to Intersection Problems.” In <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>, 88–99. WG. Teubner, 1984.","apa":"Dobkin, D., &#38; Edelsbrunner, H. (1984). Ham-sandwich theorems applied to intersection problems. In <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i> (pp. 88–99). Haus Ohrbeck, Germany: Teubner.","ieee":"D. Dobkin and H. Edelsbrunner, “Ham-sandwich theorems applied to intersection problems,” in <i>9th International Workshop on Graph Theoretic Concepts in Computer Science</i>, Haus Ohrbeck, Germany, 1984, pp. 88–99."},"publication_status":"published","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"isbn":["3-853-20311-6"]},"_id":"3513","page":"88 - 99","article_processing_charge":"No","publist_id":"2872","date_updated":"2022-01-28T12:10:55Z","publication":"9th International Workshop on Graph Theoretic Concepts in Computer Science"},{"type":"journal_article","citation":{"short":"H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, D. Wood, Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications 18 (1984) 171–183.","ista":"Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. 1984. Computing the connected components of simple rectilinear geometrical objects in D-Space. Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications. 18(2), 171–183.","mla":"Edelsbrunner, Herbert, et al. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>, vol. 18, no. 2, EDP Sciences, 1984, pp. 171–83, doi:<a href=\"https://doi.org/10.1051/ita/1984180201711\">10.1051/ita/1984180201711</a>.","ama":"Edelsbrunner H, Van Leeuwen J, Ottmann T, Wood D. Computing the connected components of simple rectilinear geometrical objects in D-Space. <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>. 1984;18(2):171-183. doi:<a href=\"https://doi.org/10.1051/ita/1984180201711\">10.1051/ita/1984180201711</a>","chicago":"Edelsbrunner, Herbert, Jan Van Leeuwen, Thomas Ottmann, and Derick Wood. “Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.” <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>. EDP Sciences, 1984. <a href=\"https://doi.org/10.1051/ita/1984180201711\">https://doi.org/10.1051/ita/1984180201711</a>.","apa":"Edelsbrunner, H., Van Leeuwen, J., Ottmann, T., &#38; Wood, D. (1984). Computing the connected components of simple rectilinear geometrical objects in D-Space. <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/ita/1984180201711\">https://doi.org/10.1051/ita/1984180201711</a>","ieee":"H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, and D. Wood, “Computing the connected components of simple rectilinear geometrical objects in D-Space,” <i>Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications</i>, vol. 18, no. 2. EDP Sciences, pp. 171–183, 1984."},"day":"01","publication_status":"published","status":"public","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jan","full_name":"Van Leeuwen, Jan","last_name":"Van Leeuwen"},{"first_name":"Thomas","last_name":"Ottmann","full_name":"Ottmann, Thomas"},{"first_name":"Derick","last_name":"Wood","full_name":"Wood, Derick"}],"abstract":[{"lang":"eng","text":"Two or more geometrical objects (solids) are said to be connected whenever their union is a connected point set in the usual sense. Sets of geometrical objects are naturally divided into connected components, which are maximal connected subsets. We show that the connected components of a given collection of n horizontal and vertical line segments in the plane can be computed in O (n log n) time and O (n) space and prove that this is essentially optimal. The result is generalized to compute the connected components of a set of n rectilinearly-oriented rectangles\r\nin the plane with the same time and space bounds. Several extensions of the results to higher dimensions and to dynamic sets of objects are discussed."}],"intvolume":"        18","page":"171 - 183","article_processing_charge":"No","publist_id":"2001","date_updated":"2022-01-27T15:22:30Z","volume":18,"publication":"Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications","issue":"2","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["0397-9326"],"eissn":["1290-385X"]},"extern":"1","_id":"4117","article_type":"original","date_published":"1984-01-01T00:00:00Z","month":"01","year":"1984","doi":"10.1051/ita/1984180201711","language":[{"iso":"eng"}],"title":"Computing the connected components of simple rectilinear geometrical objects in D-Space","publisher":"EDP Sciences","date_created":"2018-12-11T12:07:02Z"},{"quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_identifier":{"issn":["1557-895X"],"eissn":["0734-189X"]},"extern":"1","_id":"4118","article_processing_charge":"No","volume":27,"date_updated":"2022-01-28T08:03:51Z","publist_id":"2002","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"last_name":"O'Rourke","full_name":"O'Rourke, Joseph","first_name":"Joseph"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"abstract":[{"text":"A rectilinear polygon can be viewed as an art gallery room whose walls meet at right angles. An algorithm is presented that stations guards in such a room so that every interior point is visible to some guard. The algorithm partitions the polygon into L-shaped pieces, a subclass of star-shaped pieces, and locates one guard within each kernel. The algorithm runs in O(n log n) time in the worst case for a polygon of n vertices.","lang":"eng"}],"citation":{"short":"H. Edelsbrunner, J. O’Rourke, E. Welzl, Computer Vision, Graphics, and Image Processing 27 (1984) 167–176.","ista":"Edelsbrunner H, O’Rourke J, Welzl E. 1984. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing. 27(2), 167–176.","mla":"Edelsbrunner, Herbert, et al. “Stationing Guards in Rectilinear Art Galleries.” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 27, no. 2, Elsevier, 1984, pp. 167–76, doi:<a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">10.1016/S0734-189X(84)80041-9</a>.","ama":"Edelsbrunner H, O’Rourke J, Welzl E. Stationing guards in rectilinear art galleries. <i>Computer Vision, Graphics, and Image Processing</i>. 1984;27(2):167-176. doi:<a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">10.1016/S0734-189X(84)80041-9</a>","chicago":"Edelsbrunner, Herbert, Joseph O’Rourke, and Emo Welzl. “Stationing Guards in Rectilinear Art Galleries.” <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier, 1984. <a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">https://doi.org/10.1016/S0734-189X(84)80041-9</a>.","apa":"Edelsbrunner, H., O’Rourke, J., &#38; Welzl, E. (1984). Stationing guards in rectilinear art galleries. <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0734-189X(84)80041-9\">https://doi.org/10.1016/S0734-189X(84)80041-9</a>","ieee":"H. Edelsbrunner, J. O’Rourke, and E. Welzl, “Stationing guards in rectilinear art galleries,” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 27, no. 2. Elsevier, pp. 167–176, 1984."},"publication_status":"published","title":"Stationing guards in rectilinear art galleries","year":"1984","doi":"10.1016/S0734-189X(84)80041-9","page":"167 - 176","publication":"Computer Vision, Graphics, and Image Processing","issue":"2","status":"public","intvolume":"        27","type":"journal_article","day":"01","date_created":"2018-12-11T12:07:02Z","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","article_type":"original","date_published":"1984-08-01T00:00:00Z","month":"08"},{"page":"265 - 272","publication":"11th International Symposium on Mathematical Foundations of Computer Science","status":"public","intvolume":"       176","series_title":"MFCS","type":"conference","day":"01","date_created":"2018-12-11T12:07:03Z","conference":{"start_date":"1984-09-03","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"1984-09-07","location":"Praha, Czechoslovakia"},"language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Springer","date_published":"1984-01-01T00:00:00Z","month":"01","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"isbn":["3-540-13372-0"]},"_id":"4119","article_processing_charge":"No","date_updated":"2022-01-28T08:52:23Z","publist_id":"2003","volume":176,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"citation":{"ista":"Edelsbrunner H, Welzl E. 1984. Monotone edge sequences in line arrangements and applications. 11th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer ScienceMFCS, LNCS, vol. 176, 265–272.","short":"H. Edelsbrunner, E. Welzl, in:, 11th International Symposium on Mathematical Foundations of Computer Science, Springer, 1984, pp. 265–272.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” <i>11th International Symposium on Mathematical Foundations of Computer Science</i>, vol. 176, Springer, 1984, pp. 265–72, doi:<a href=\"https://doi.org/10.1007/BFb0030307\">10.1007/BFb0030307</a>.","ama":"Edelsbrunner H, Welzl E. Monotone edge sequences in line arrangements and applications. In: <i>11th International Symposium on Mathematical Foundations of Computer Science</i>. Vol 176. MFCS. Springer; 1984:265-272. doi:<a href=\"https://doi.org/10.1007/BFb0030307\">10.1007/BFb0030307</a>","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “Monotone Edge Sequences in Line Arrangements and Applications.” In <i>11th International Symposium on Mathematical Foundations of Computer Science</i>, 176:265–72. MFCS. Springer, 1984. <a href=\"https://doi.org/10.1007/BFb0030307\">https://doi.org/10.1007/BFb0030307</a>.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1984). Monotone edge sequences in line arrangements and applications. In <i>11th International Symposium on Mathematical Foundations of Computer Science</i> (Vol. 176, pp. 265–272). Praha, Czechoslovakia: Springer. <a href=\"https://doi.org/10.1007/BFb0030307\">https://doi.org/10.1007/BFb0030307</a>","ieee":"H. Edelsbrunner and E. Welzl, “Monotone edge sequences in line arrangements and applications,” in <i>11th International Symposium on Mathematical Foundations of Computer Science</i>, Praha, Czechoslovakia, 1984, vol. 176, pp. 265–272."},"publication_status":"published","alternative_title":["LNCS"],"title":"Monotone edge sequences in line arrangements and applications","doi":"10.1007/BFb0030307","year":"1984"},{"date_published":"1984-01-01T00:00:00Z","article_type":"original","month":"01","doi":"10.1007/BF01890115","year":"1984","language":[{"iso":"eng"}],"title":"Efficient algorithms for agglomerative hierarchical clustering methods","publisher":"Springer","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2FBF01890115"}],"date_created":"2018-12-11T12:07:04Z","type":"journal_article","day":"01","citation":{"chicago":"Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” <i>Journal of Classification</i>. Springer, 1984. <a href=\"https://doi.org/10.1007/BF01890115\">https://doi.org/10.1007/BF01890115</a>.","apa":"Day, W., &#38; Edelsbrunner, H. (1984). Efficient algorithms for agglomerative hierarchical clustering methods. <i>Journal of Classification</i>. Springer. <a href=\"https://doi.org/10.1007/BF01890115\">https://doi.org/10.1007/BF01890115</a>","ieee":"W. Day and H. Edelsbrunner, “Efficient algorithms for agglomerative hierarchical clustering methods,” <i>Journal of Classification</i>, vol. 1. Springer, pp. 7–24, 1984.","ista":"Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24.","short":"W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.","mla":"Day, William, and Herbert Edelsbrunner. “Efficient Algorithms for Agglomerative Hierarchical Clustering Methods.” <i>Journal of Classification</i>, vol. 1, Springer, 1984, pp. 7–24, doi:<a href=\"https://doi.org/10.1007/BF01890115\">10.1007/BF01890115</a>.","ama":"Day W, Edelsbrunner H. Efficient algorithms for agglomerative hierarchical clustering methods. <i>Journal of Classification</i>. 1984;1:7-24. doi:<a href=\"https://doi.org/10.1007/BF01890115\">10.1007/BF01890115</a>"},"publication_status":"published","author":[{"first_name":"William","last_name":"Day","full_name":"Day, William"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"status":"public","abstract":[{"text":"Whenevern objects are characterized by a matrix of pairwise dissimilarities, they may be clustered by any of a number of sequential, agglomerative, hierarchical, nonoverlapping (SAHN) clustering methods. These SAHN clustering methods are defined by a paradigmatic algorithm that usually requires 0(n 3) time, in the worst case, to cluster the objects. An improved algorithm (Anderberg 1973), while still requiring 0(n 3) worst-case time, can reasonably be expected to exhibit 0(n 2) expected behavior. By contrast, we describe a SAHN clustering algorithm that requires 0(n 2 logn) time in the worst case. When SAHN clustering methods exhibit reasonable space distortion properties, further improvements are possible. We adapt a SAHN clustering algorithm, based on the efficient construction of nearest neighbor chains, to obtain a reasonably general SAHN clustering algorithm that requires in the worst case 0(n 2) time and space.\r\nWhenevern objects are characterized byk-tuples of real numbers, they may be clustered by any of a family of centroid SAHN clustering methods. These methods are based on a geometric model in which clusters are represented by points ink-dimensional real space and points being agglomerated are replaced by a single (centroid) point. For this model, we have solved a class of special packing problems involving point-symmetric convex objects and have exploited it to design an efficient centroid clustering algorithm. Specifically, we describe a centroid SAHN clustering algorithm that requires 0(n 2) time, in the worst case, for fixedk and for a family of dissimilarity measures including the Manhattan, Euclidean, Chebychev and all other Minkowski metrics.","lang":"eng"}],"intvolume":"         1","page":"7 - 24","article_processing_charge":"No","volume":1,"date_updated":"2022-01-27T14:16:27Z","publist_id":"1998","publication":"Journal of Classification","oa_version":"None","quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"eissn":["1432-1343"],"issn":["0176-4268"]},"_id":"4121"},{"date_published":"1984-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Springer","date_created":"2018-12-11T12:07:04Z","conference":{"start_date":"1984-04-11","name":"STACS: Theoretical Aspects of Computer Science","end_date":"1984-04-13","location":"Paris, France"},"series_title":"STACS","type":"conference","day":"01","status":"public","intvolume":"       166","page":"1 - 13","publication":"1st Symposium of Theoretical Aspects of Computer Science","year":"1984","doi":"10.1007/3-540-12920-0_1","title":"Key-problems and key-methods in computational geometry","alternative_title":["LNCS"],"citation":{"ama":"Edelsbrunner H. Key-problems and key-methods in computational geometry. In: <i>1st Symposium of Theoretical Aspects of Computer Science</i>. Vol 166. STACS. Springer; 1984:1-13. doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_1\">10.1007/3-540-12920-0_1</a>","mla":"Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” <i>1st Symposium of Theoretical Aspects of Computer Science</i>, vol. 166, Springer, 1984, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_1\">10.1007/3-540-12920-0_1</a>.","ista":"Edelsbrunner H. 1984. Key-problems and key-methods in computational geometry. 1st Symposium of Theoretical Aspects of Computer Science. STACS: Theoretical Aspects of Computer ScienceSTACS, LNCS, vol. 166, 1–13.","short":"H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.","apa":"Edelsbrunner, H. (1984). Key-problems and key-methods in computational geometry. In <i>1st Symposium of Theoretical Aspects of Computer Science</i> (Vol. 166, pp. 1–13). Paris, France: Springer. <a href=\"https://doi.org/10.1007/3-540-12920-0_1\">https://doi.org/10.1007/3-540-12920-0_1</a>","ieee":"H. Edelsbrunner, “Key-problems and key-methods in computational geometry,” in <i>1st Symposium of Theoretical Aspects of Computer Science</i>, Paris, France, 1984, vol. 166, pp. 1–13.","chicago":"Edelsbrunner, Herbert. “Key-Problems and Key-Methods in Computational Geometry.” In <i>1st Symposium of Theoretical Aspects of Computer Science</i>, 166:1–13. STACS. Springer, 1984. <a href=\"https://doi.org/10.1007/3-540-12920-0_1\">https://doi.org/10.1007/3-540-12920-0_1</a>."},"publication_status":"published","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert"}],"abstract":[{"text":"Computational geometry, considered a subfield of computer science, is concerned with the computational aspects of geometric problems. The increasing activity in this rather young field made it split into several reasonably independent subareas. This paper presents several key-problems of the classical part of computational geometry which exhibit strong interrelations. A unified view of the problems is stressed, and the general ideas behind the methods that solve them are worked out.","lang":"eng"}],"article_processing_charge":"No","volume":166,"publist_id":"1999","date_updated":"2022-01-27T14:48:15Z","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","publication_identifier":{"isbn":["3-540-12920-0"]},"_id":"4122"},{"abstract":[{"lang":"eng","text":"Windowing a two-dimensional picture means to determine those line segments of the picture that are visible through an axis-parallel window. A study of some algorithmic problems involved in windowing a picture is offered. Some methods from computational geometry are exploited to store the picture in a computer such that (1) those line segments inside or partially inside of a window can be determined efficiently, and (2) the set of those line segments can be maintained efficiently while the window is moved parallel to a coordinate axis and/or it is enlarged or reduced."}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Overmars","full_name":"Overmars, Mark","first_name":"Mark"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"}],"citation":{"short":"H. Edelsbrunner, M. Overmars, R. Seidel, Computer Vision, Graphics, and Image Processing 28 (1984) 92–108.","ista":"Edelsbrunner H, Overmars M, Seidel R. 1984. Some methods of computational geometry applied to computer graphics. Computer Vision, Graphics, and Image Processing. 28(1), 92–108.","ama":"Edelsbrunner H, Overmars M, Seidel R. Some methods of computational geometry applied to computer graphics. <i>Computer Vision, Graphics, and Image Processing</i>. 1984;28(1):92-108. doi:<a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">10.1016/0734-189X(84)90142-7</a>","mla":"Edelsbrunner, Herbert, et al. “Some Methods of Computational Geometry Applied to Computer Graphics.” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 28, no. 1, Elsevier, 1984, pp. 92–108, doi:<a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">10.1016/0734-189X(84)90142-7</a>.","chicago":"Edelsbrunner, Herbert, Mark Overmars, and Raimund Seidel. “Some Methods of Computational Geometry Applied to Computer Graphics.” <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier, 1984. <a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">https://doi.org/10.1016/0734-189X(84)90142-7</a>.","ieee":"H. Edelsbrunner, M. Overmars, and R. Seidel, “Some methods of computational geometry applied to computer graphics,” <i>Computer Vision, Graphics, and Image Processing</i>, vol. 28, no. 1. Elsevier, pp. 92–108, 1984.","apa":"Edelsbrunner, H., Overmars, M., &#38; Seidel, R. (1984). Some methods of computational geometry applied to computer graphics. <i>Computer Vision, Graphics, and Image Processing</i>. Elsevier. <a href=\"https://doi.org/10.1016/0734-189X(84)90142-7\">https://doi.org/10.1016/0734-189X(84)90142-7</a>"},"publication_status":"published","extern":"1","publication_identifier":{"eissn":["1557-895X"],"issn":["0734-189X"]},"_id":"4123","quality_controlled":"1","oa_version":"None","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Research reported in this paper was done while the second author visited the Technical University of Graz. He was supported by the Netherlands Organization for the Advancement of Pure Research (ZWO). The first author was supported by the Austrian Fonds zur Foerderung der wissenschaftlichen Forschung.\r\n","article_processing_charge":"No","publist_id":"2000","volume":28,"date_updated":"2022-01-27T15:10:04Z","title":"Some methods of computational geometry applied to computer graphics","year":"1984","doi":"10.1016/0734-189X(84)90142-7","intvolume":"        28","status":"public","day":"01","type":"journal_article","publication":"Computer Vision, Graphics, and Image Processing","issue":"1","page":"92 - 108","publisher":"Elsevier","language":[{"iso":"eng"}],"month":"10","article_type":"original","date_published":"1984-10-01T00:00:00Z","date_created":"2018-12-11T12:07:04Z"},{"publication_status":"published","citation":{"chicago":"Barton, Nicholas H, and Brian Charlesworth. “Genetic Revolutions, Founder Effects, and Speciation.” <i>Annual Review of Ecology and Systematics</i>. Annual Reviews, 1984. <a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">https://doi.org/10.1146/annurev.es.15.110184.001025</a>.","ieee":"N. H. Barton and B. Charlesworth, “Genetic revolutions, founder effects, and speciation,” <i>Annual Review of Ecology and Systematics</i>, vol. 15. Annual Reviews, pp. 133–164, 1984.","apa":"Barton, N. H., &#38; Charlesworth, B. (1984). Genetic revolutions, founder effects, and speciation. <i>Annual Review of Ecology and Systematics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">https://doi.org/10.1146/annurev.es.15.110184.001025</a>","ista":"Barton NH, Charlesworth B. 1984. Genetic revolutions, founder effects, and speciation. Annual Review of Ecology and Systematics. 15, 133–164.","short":"N.H. Barton, B. Charlesworth, Annual Review of Ecology and Systematics 15 (1984) 133–164.","ama":"Barton NH, Charlesworth B. Genetic revolutions, founder effects, and speciation. <i>Annual Review of Ecology and Systematics</i>. 1984;15:133-164. doi:<a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">10.1146/annurev.es.15.110184.001025</a>","mla":"Barton, Nicholas H., and Brian Charlesworth. “Genetic Revolutions, Founder Effects, and Speciation.” <i>Annual Review of Ecology and Systematics</i>, vol. 15, Annual Reviews, 1984, pp. 133–64, doi:<a href=\"https://doi.org/10.1146/annurev.es.15.110184.001025\">10.1146/annurev.es.15.110184.001025</a>."},"author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H"},{"full_name":"Charlesworth, Brian","last_name":"Charlesworth","first_name":"Brian"}],"date_updated":"2022-01-27T13:51:54Z","publist_id":"1713","volume":15,"article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"We thank Professor B. C. Clarke, Dr. K. Janson, Dr. R. Rockwell, Dr. M. J. van den Berg, and Dr. R. D. Ward for making their work available before publication. Dr. S. J. Arnold and Dr. L. Partridge provided us with useful references, and Dr. D. Charlesworth, Dr. J. M. Szymura, and Dr. J. S. Jones critically reviewed the manuscript.","oa_version":"None","quality_controlled":"1","_id":"4327","extern":"1","publication_identifier":{"eissn":["1545-2069"],"issn":["0066-4162"]},"year":"1984","doi":"10.1146/annurev.es.15.110184.001025","title":"Genetic revolutions, founder effects, and speciation","main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.es.15.110184.001025"}],"type":"journal_article","day":"01","status":"public","intvolume":"        15","page":"133 - 164","publication":"Annual Review of Ecology and Systematics","article_type":"original","date_published":"1984-11-01T00:00:00Z","month":"11","language":[{"iso":"eng"}],"publisher":"Annual Reviews","scopus_import":"1","date_created":"2018-12-11T12:08:16Z"}]