[{"publication_status":"published","page":"7 - 24","date_published":"1984-01-01T00:00:00Z","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2FBF01890115"}],"month":"01","_id":"4121","article_type":"original","status":"public","year":"1984","publist_id":"1998","intvolume":"         1","publication_identifier":{"eissn":["1432-1343"],"issn":["0176-4268"]},"extern":"1","author":[{"first_name":"William","last_name":"Day","full_name":"Day, William"},{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"}],"publisher":"Springer","day":"01","date_created":"2018-12-11T12:07:04Z","citation":{"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>","short":"W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.","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>.","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.","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>","ista":"Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 7–24."},"doi":"10.1007/BF01890115","oa_version":"None","quality_controlled":"1","title":"Efficient algorithms for agglomerative hierarchical clustering methods","type":"journal_article","article_processing_charge":"No","volume":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","language":[{"iso":"eng"}],"publication":"Journal of Classification","abstract":[{"lang":"eng","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."}],"date_updated":"2022-01-27T14:16:27Z"},{"series_title":"STACS","date_published":"1984-01-01T00:00:00Z","publication_status":"published","date_created":"2018-12-11T12:07:04Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"publication_identifier":{"isbn":["3-540-12920-0"]},"intvolume":"       166","publist_id":"1999","year":"1984","status":"public","month":"01","scopus_import":"1","alternative_title":["LNCS"],"title":"Key-problems and key-methods in computational geometry","quality_controlled":"1","doi":"10.1007/3-540-12920-0_1","oa_version":"None","publication":"1st Symposium of Theoretical Aspects of Computer Science","article_processing_charge":"No","page":"1 - 13","publisher":"Springer","day":"01","extern":"1","_id":"4122","conference":{"location":"Paris, France","end_date":"1984-04-13","name":"STACS: Theoretical Aspects of Computer Science","start_date":"1984-04-11"},"citation":{"short":"H. Edelsbrunner, in:, 1st Symposium of Theoretical Aspects of Computer Science, Springer, 1984, pp. 1–13.","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.","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>","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>.","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."},"date_updated":"2022-01-27T14:48:15Z","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"}],"language":[{"iso":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","volume":166},{"oa_version":"None","doi":"10.1016/0734-189X(84)90142-7","title":"Some methods of computational geometry applied to computer graphics","quality_controlled":"1","article_processing_charge":"No","publication":"Computer Vision, Graphics, and Image Processing","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","publication_status":"published","date_published":"1984-10-01T00:00:00Z","status":"public","month":"10","year":"1984","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"last_name":"Overmars","first_name":"Mark","full_name":"Overmars, Mark"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"}],"publist_id":"2000","intvolume":"        28","publication_identifier":{"issn":["0734-189X"],"eissn":["1557-895X"]},"date_created":"2018-12-11T12:07:04Z","citation":{"short":"H. Edelsbrunner, M. Overmars, R. Seidel, Computer Vision, Graphics, and Image Processing 28 (1984) 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>.","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.","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>","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."},"issue":"1","type":"journal_article","volume":28,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"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.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2022-01-27T15:10:04Z","page":"92 - 108","_id":"4123","article_type":"original","extern":"1","day":"01","publisher":"Elsevier"},{"citation":{"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>.","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>","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>","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.","ista":"Barton NH, Charlesworth B. 1984. Genetic revolutions, founder effects, and speciation. Annual Review of Ecology and Systematics. 15, 133–164."},"date_updated":"2022-01-27T13:51:54Z","language":[{"iso":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","volume":15,"type":"journal_article","page":"133 - 164","publisher":"Annual Reviews","day":"01","extern":"1","_id":"4327","article_type":"original","scopus_import":"1","title":"Genetic revolutions, founder effects, and speciation","quality_controlled":"1","oa_version":"None","doi":"10.1146/annurev.es.15.110184.001025","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.","publication":"Annual Review of Ecology and Systematics","article_processing_charge":"No","date_published":"1984-11-01T00:00:00Z","main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.es.15.110184.001025"}],"publication_status":"published","date_created":"2018-12-11T12:08:16Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"full_name":"Charlesworth, Brian","last_name":"Charlesworth","first_name":"Brian"}],"publication_identifier":{"issn":["0066-4162"],"eissn":["1545-2069"]},"publist_id":"1713","intvolume":"        15","year":"1984","status":"public","month":"11"},{"editor":[{"full_name":"Preparata, Franco","last_name":"Preparata","first_name":"Franco"}],"page":"109 - 125","publication_status":"published","main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1983-B-01-ExpectedSegmentTrees.pdf"}],"date_published":"1983-01-01T00:00:00Z","_id":"3562","month":"01","status":"public","year":"1983","publist_id":"2823","intvolume":"         1","author":[{"last_name":"Bucher","first_name":"W.","full_name":"Bucher, W."},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"extern":"1","day":"01","publisher":"Elsevier","date_created":"2018-12-11T12:03:58Z","citation":{"ista":"Bucher W, Edelsbrunner H. 1983.On expected- and worst-case segment trees. In: Computational Geometry: Theory and Applications. Advances in Computing Research , vol. 1, 109–125.","apa":"Bucher, W., &#38; Edelsbrunner, H. (1983). On expected- and worst-case segment trees. In F. Preparata (Ed.), <i>Computational Geometry: Theory and Applications</i> (Vol. 1, pp. 109–125). Elsevier.","chicago":"Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” In <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, 1:109–25. Elsevier, 1983.","ieee":"W. Bucher and H. Edelsbrunner, “On expected- and worst-case segment trees,” in <i>Computational Geometry: Theory and Applications</i>, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 109–125.","short":"W. Bucher, H. Edelsbrunner, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 109–125.","ama":"Bucher W, Edelsbrunner H. On expected- and worst-case segment trees. In: Preparata F, ed. <i>Computational Geometry: Theory and Applications</i>. Vol 1. Elsevier; 1983:109-125.","mla":"Bucher, W., and Herbert Edelsbrunner. “On Expected- and Worst-Case Segment Trees.” <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 109–25."},"oa_version":"None","quality_controlled":"1","title":"On expected- and worst-case segment trees","alternative_title":["Advances in Computing Research "],"article_processing_charge":"No","volume":1,"type":"book_chapter","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","abstract":[{"lang":"eng","text":"The segment tree is a data structure for storing and maintaining a set of intervals on the real line. It has been used for an efficient algorithmic approach in a variety of geometric problems including the problem of deter-mining intersections among axis-parallel rectangles, computing the measure of a set of axis-parallel rectangles, and locating a point in a planar subdivision. A segment tree for n intervals requires 0(n) space in the best case and 0(n log n) space in the worst case. It is shown that segment trees require 0(n log n) space even in the expected case. Additionally, the worst-case upper bound on the space requirement of segment trees is improved over the previously known bound. Surprisingly, the space requirements in the expected and in the worst case differ only little. \r\n"}],"date_updated":"2022-01-27T07:40:13Z"},{"editor":[{"last_name":"Preparata","first_name":"Franco","full_name":"Preparata, Franco"}],"page":"35 - 59","publication_status":"published","date_published":"1983-01-01T00:00:00Z","_id":"3563","month":"01","status":"public","year":"1983","publist_id":"2822","publication_identifier":{"isbn":["0-89232-356-6"]},"intvolume":"         1","author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"Mark","last_name":"Overmars","full_name":"Overmars, Mark"},{"full_name":"Wood, Derick","last_name":"Wood","first_name":"Derick"}],"extern":"1","publisher":"Elsevier","day":"01","date_created":"2018-12-11T12:03:59Z","oa_version":"None","citation":{"ista":"Edelsbrunner H, Overmars M, Wood D. 1983.Graphics in Flatland: a case study. In: Computational Geometry: Theory and Applications.  Advances in Computing Research, vol. 1, 35–59.","chicago":"Edelsbrunner, Herbert, Mark Overmars, and Derick Wood. “Graphics in Flatland: A Case Study.” In <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, 1:35–59. Elsevier, 1983.","ieee":"H. Edelsbrunner, M. Overmars, and D. Wood, “Graphics in Flatland: a case study,” in <i>Computational Geometry: Theory and Applications</i>, vol. 1, F. Preparata, Ed. Elsevier, 1983, pp. 35–59.","apa":"Edelsbrunner, H., Overmars, M., &#38; Wood, D. (1983). Graphics in Flatland: a case study. In F. Preparata (Ed.), <i>Computational Geometry: Theory and Applications</i> (Vol. 1, pp. 35–59). Elsevier.","ama":"Edelsbrunner H, Overmars M, Wood D. Graphics in Flatland: a case study. In: Preparata F, ed. <i>Computational Geometry: Theory and Applications</i>. Vol 1. Elsevier; 1983:35-59.","short":"H. Edelsbrunner, M. Overmars, D. Wood, in:, F. Preparata (Ed.), Computational Geometry: Theory and Applications, Elsevier, 1983, pp. 35–59.","mla":"Edelsbrunner, Herbert, et al. “Graphics in Flatland: A Case Study.” <i>Computational Geometry: Theory and Applications</i>, edited by Franco Preparata, vol. 1, Elsevier, 1983, pp. 35–59."},"quality_controlled":"1","title":"Graphics in Flatland: a case study","alternative_title":[" Advances in Computing Research"],"volume":1,"article_processing_charge":"No","type":"book_chapter","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","language":[{"iso":"eng"}],"publication":"Computational Geometry: Theory and Applications","abstract":[{"text":"Usually in computer graphics, a two-dimensional view of a set of three-dimensional objects is considered. In this article we reduce the dimensionality by one in each case. In other words we study what, for obvious reasons, we call Flatland graphics. This forms the beginning of a mathematical investigation of computer graphics and, at the same time, provides uniform solutions for a number of computational geometry problems. In particular we study the maintenance of a view during insertion and deletion of objects and the \"frame-to-frame\" coherence while walking around a set of objects. Both parallel and perspective projections are considered. Our major concern is convex objects that are simple—in a sense, made precise in this article. However, we will close this article by discussing some possible extensions to nonconvex objects and/or to higher dimensions. The investigation also serves to demonstrate a number of tools that have been developed recently in the context of computational geometry. For example. dynamization and searching. \r\n\r\n","lang":"eng"}],"date_updated":"2022-01-25T15:49:17Z"},{"title":"Neue Entwicklungen im Bereich Datenstrukturen","quality_controlled":"1","citation":{"ista":"Edelsbrunner H. 1983.Neue Entwicklungen im Bereich Datenstrukturen. In: Überblicke Informationsverarbeitung . , 55–109.","apa":"Edelsbrunner, H. (1983). Neue Entwicklungen im Bereich Datenstrukturen. In H. Maurer (Ed.), <i>Überblicke Informationsverarbeitung </i> (pp. 55–109). BI Wissenschaftsverlag.","chicago":"Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” In <i>Überblicke Informationsverarbeitung </i>, edited by Hermann Maurer, 55–109. BI Wissenschaftsverlag, 1983.","ieee":"H. Edelsbrunner, “Neue Entwicklungen im Bereich Datenstrukturen,” in <i>Überblicke Informationsverarbeitung </i>, H. Maurer, Ed. BI Wissenschaftsverlag, 1983, pp. 55–109.","short":"H. Edelsbrunner, in:, H. Maurer (Ed.), Überblicke Informationsverarbeitung , BI Wissenschaftsverlag, 1983, pp. 55–109.","ama":"Edelsbrunner H. Neue Entwicklungen im Bereich Datenstrukturen. In: Maurer H, ed. <i>Überblicke Informationsverarbeitung </i>. BI Wissenschaftsverlag; 1983:55-109.","mla":"Edelsbrunner, Herbert. “Neue Entwicklungen im Bereich Datenstrukturen.” <i>Überblicke Informationsverarbeitung </i>, edited by Hermann Maurer, BI Wissenschaftsverlag, 1983, pp. 55–109."},"oa_version":"None","publication":"Überblicke Informationsverarbeitung ","language":[{"iso":"ger"}],"date_updated":"2022-01-25T15:28:05Z","article_processing_charge":"No","type":"book_chapter","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_published":"1983-01-01T00:00:00Z","editor":[{"last_name":"Maurer","first_name":"Hermann","full_name":"Maurer, Hermann"}],"page":"55 - 109","publication_status":"published","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"extern":"1","publication_identifier":{"isbn":["9783411016587"]},"publist_id":"2821","date_created":"2018-12-11T12:03:59Z","day":"01","publisher":"BI Wissenschaftsverlag","status":"public","_id":"3564","month":"01","year":"1983"},{"citation":{"ieee":"N. H. Barton and S. Jones, “Mitochondrial DNA: new clues about evolution,” <i>Nature</i>, vol. 306. Springer Nature, pp. 317–318, 1983.","chicago":"Barton, Nicholas H, and Steve Jones. “Mitochondrial DNA: New Clues about Evolution.” <i>Nature</i>. Springer Nature, 1983. <a href=\"https://doi.org/10.1038/306317a0\">https://doi.org/10.1038/306317a0</a>.","apa":"Barton, N. H., &#38; Jones, S. (1983). Mitochondrial DNA: new clues about evolution. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/306317a0\">https://doi.org/10.1038/306317a0</a>","ista":"Barton NH, Jones S. 1983. Mitochondrial DNA: new clues about evolution. Nature. 306, 317–318.","mla":"Barton, Nicholas H., and Steve Jones. “Mitochondrial DNA: New Clues about Evolution.” <i>Nature</i>, vol. 306, Springer Nature, 1983, pp. 317–18, doi:<a href=\"https://doi.org/10.1038/306317a0\">10.1038/306317a0</a>.","ama":"Barton NH, Jones S. Mitochondrial DNA: new clues about evolution. <i>Nature</i>. 1983;306:317-318. doi:<a href=\"https://doi.org/10.1038/306317a0\">10.1038/306317a0</a>","short":"N.H. Barton, S. Jones, Nature 306 (1983) 317–318."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":306,"date_updated":"2022-01-25T15:17:15Z","language":[{"iso":"eng"}],"page":"317 - 318","article_type":"original","_id":"3598","day":"24","publisher":"Springer Nature","extern":"1","oa_version":"None","doi":"10.1038/306317a0","external_id":{"pmid":["6646215"]},"scopus_import":"1","title":"Mitochondrial DNA: new clues about evolution","quality_controlled":"1","article_processing_charge":"No","publication":"Nature","pmid":1,"publication_status":"published","main_file_link":[{"url":"https://www.nature.com/articles/306317a0"}],"date_published":"1983-11-24T00:00:00Z","year":"1983","status":"public","month":"11","date_created":"2018-12-11T12:04:10Z","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton"},{"last_name":"Jones","first_name":"Steve","full_name":"Jones, Steve"}],"publist_id":"2785","intvolume":"       306","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]}},{"oa_version":"None","doi":"10.1111/j.1095-8312.1983.tb00776.x","scopus_import":"1","title":"Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris","quality_controlled":"1","article_processing_charge":"No","publication":"Biological Journal of the Linnean Society","publication_status":"published","date_published":"1983-02-01T00:00:00Z","main_file_link":[{"url":"https://academic.oup.com/biolinnean/article-abstract/19/1/51/2666256?redirectedFrom=fulltext"}],"year":"1983","status":"public","month":"02","date_created":"2018-12-11T12:04:31Z","author":[{"full_name":"Halliday, Bruce","first_name":"Bruce","last_name":"Halliday"},{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"full_name":"Hewitt, Godfrey","first_name":"Godfrey","last_name":"Hewitt"}],"publist_id":"2717","publication_identifier":{"eissn":["1095-8312"],"issn":["0024-4066"]},"intvolume":"        19","citation":{"ista":"Halliday B, Barton NH, Hewitt G. 1983. Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. Biological Journal of the Linnean Society. 19(1), 51–62.","chicago":"Halliday, Bruce, Nicholas H Barton, and Godfrey Hewitt. “Electrophoretic Analysis of a Chromosomal Hybrid Zone in the Grasshopper Podisma Pedestris.” <i>Biological Journal of the Linnean Society</i>. Oxford University Press, 1983. <a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">https://doi.org/10.1111/j.1095-8312.1983.tb00776.x</a>.","ieee":"B. Halliday, N. H. Barton, and G. Hewitt, “Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris,” <i>Biological Journal of the Linnean Society</i>, vol. 19, no. 1. Oxford University Press, pp. 51–62, 1983.","apa":"Halliday, B., Barton, N. H., &#38; Hewitt, G. (1983). Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. <i>Biological Journal of the Linnean Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">https://doi.org/10.1111/j.1095-8312.1983.tb00776.x</a>","ama":"Halliday B, Barton NH, Hewitt G. Electrophoretic analysis of a chromosomal hybrid zone in the grasshopper Podisma pedestris. <i>Biological Journal of the Linnean Society</i>. 1983;19(1):51-62. doi:<a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">10.1111/j.1095-8312.1983.tb00776.x</a>","short":"B. Halliday, N.H. Barton, G. Hewitt, Biological Journal of the Linnean Society 19 (1983) 51–62.","mla":"Halliday, Bruce, et al. “Electrophoretic Analysis of a Chromosomal Hybrid Zone in the Grasshopper Podisma Pedestris.” <i>Biological Journal of the Linnean Society</i>, vol. 19, no. 1, Oxford University Press, 1983, pp. 51–62, doi:<a href=\"https://doi.org/10.1111/j.1095-8312.1983.tb00776.x\">10.1111/j.1095-8312.1983.tb00776.x</a>."},"issue":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","keyword":["Hybrid zone","Electrophoresis","Podisma pedestris","Polymorphism"],"type":"journal_article","volume":19,"date_updated":"2022-01-25T14:52:15Z","abstract":[{"text":"We have made an extensive allozyme survey of 21 enzyme and protein loci in populations of the alpine grasshopper Podisma pedestris. This species occurs in two races, differing by a chromosomal fusion which separates the ancestral XO/XX race from a derived neo-XY race. These races also differ in DNA content, and hybrids between them have reduced viability. Electrophoresis reveals that the amount of genetic differentiation between these races is no greater than the variation among populations within each race. Both larger-scale surveys and a detailed survey of an area where the races hybridize, show that the chromosomal change is not correlated with gene frequency changes at any of the 21 loci studied. These findings are consistent with recently developed theory concerning the strength of the barrier to gene flow posed by a hybrid zone with characteristics such as those measured experimentally in Podisma. It is argued that hybrid zones in other species which involve allozymic differences do so because of stronger selection against hybrids rather than through mating isolation.","lang":"eng"}],"language":[{"iso":"eng"}],"page":"51 - 62","_id":"3666","article_type":"original","publisher":"Oxford University Press","day":"01","extern":"1"},{"article_type":"original","_id":"3667","extern":"1","publisher":"Nature Publishing Group","day":"01","page":"139 - 146","volume":50,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Populations of the grasshopper Podisma pedestris were collected from two ends of a zone of hybridization between two chromosome races, at Seyne and Tende in southern France. 21 enzyme and protein loci were detected by gel electrophoresis. Six of these loci showed widespread polymorphism, and a further eleven had very little or no variation. Two loci (Idh, 6Pgd) had rare alleles in different frequencies in the two areas surveyed. The remaining two loci (Mdh-1, Mdh-2) showed a marked increase in the frequency of rare variants, from 1 per cent outside the hybrid zone, up to 5 per cent at its centre. This region of increased electrophoretic variation coincided with the chromosomal cline between the two races, and with a region of decreased viability. It was spread over about the same width as the chromosomal cline. Possible explanations for this extra variation include intragenic recombination and elevated mutation rates."}],"date_updated":"2022-01-25T14:07:12Z","citation":{"short":"N.H. Barton, B. Halliday, G. Hewitt, Heredity 50 (1983) 139–146.","ama":"Barton NH, Halliday B, Hewitt G. Rare electrophoretic variants in a hybrid zone. <i>Heredity</i>. 1983;50(2):139-146. doi:<a href=\"https://doi.org/10.1038/hdy.1983.15\">10.1038/hdy.1983.15</a>","mla":"Barton, Nicholas H., et al. “Rare Electrophoretic Variants in a Hybrid Zone.” <i>Heredity</i>, vol. 50, no. 2, Nature Publishing Group, 1983, pp. 139–46, doi:<a href=\"https://doi.org/10.1038/hdy.1983.15\">10.1038/hdy.1983.15</a>.","ista":"Barton NH, Halliday B, Hewitt G. 1983. Rare electrophoretic variants in a hybrid zone. Heredity. 50(2), 139–146.","apa":"Barton, N. H., Halliday, B., &#38; Hewitt, G. (1983). Rare electrophoretic variants in a hybrid zone. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1983.15\">https://doi.org/10.1038/hdy.1983.15</a>","ieee":"N. H. Barton, B. Halliday, and G. Hewitt, “Rare electrophoretic variants in a hybrid zone,” <i>Heredity</i>, vol. 50, no. 2. Nature Publishing Group, pp. 139–146, 1983.","chicago":"Barton, Nicholas H, Bruce Halliday, and Godfrey Hewitt. “Rare Electrophoretic Variants in a Hybrid Zone.” <i>Heredity</i>. Nature Publishing Group, 1983. <a href=\"https://doi.org/10.1038/hdy.1983.15\">https://doi.org/10.1038/hdy.1983.15</a>."},"issue":"2","month":"04","status":"public","year":"1983","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"publist_id":"2716","intvolume":"        50","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"full_name":"Halliday, Bruce","last_name":"Halliday","first_name":"Bruce"},{"full_name":"Hewitt, Godfrey","first_name":"Godfrey","last_name":"Hewitt"}],"date_created":"2018-12-11T12:04:31Z","publication_status":"published","date_published":"1983-04-01T00:00:00Z","main_file_link":[{"url":"https://www.nature.com/articles/hdy198315","open_access":"1"}],"article_processing_charge":"No","publication":"Heredity","acknowledgement":"We would like to thank Manse East, Lynda Flegg, and Sim Webb for their excellent technical assistance, and Prof. J. M. Thoday for helpful comments. Financial support was provided by a NERC Studentship to NHB, and a SRC grant to GMH.","doi":"10.1038/hdy.1983.15","oa_version":"Published Version","quality_controlled":"1","title":"Rare electrophoretic variants in a hybrid zone","scopus_import":"1"},{"issue":"3","citation":{"ista":"Barton NH. 1983. Multilocus clines. Evolution; International Journal of Organic Evolution. 37(3), 454–471.","ieee":"N. H. Barton, “Multilocus clines,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 37, no. 3. Society for the Study of Evolution, pp. 454–471, 1983.","chicago":"Barton, Nicholas H. “Multilocus Clines.” <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution, 1983. <a href=\"https://doi.org/10.2307/2408260\">https://doi.org/10.2307/2408260</a>.","apa":"Barton, N. H. (1983). Multilocus clines. <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution. <a href=\"https://doi.org/10.2307/2408260\">https://doi.org/10.2307/2408260</a>","ama":"Barton NH. Multilocus clines. <i>Evolution; International Journal of Organic Evolution</i>. 1983;37(3):454-471. doi:<a href=\"https://doi.org/10.2307/2408260\">10.2307/2408260</a>","short":"N.H. Barton, Evolution; International Journal of Organic Evolution 37 (1983) 454–471.","mla":"Barton, Nicholas H. “Multilocus Clines.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 37, no. 3, Society for the Study of Evolution, 1983, pp. 454–71, doi:<a href=\"https://doi.org/10.2307/2408260\">10.2307/2408260</a>."},"abstract":[{"text":"When two populations which differ at many loci meet, the degree of introgression of alleles across the boundary will depend on the selection acting on each locus (s), the rate of recombination between adjacent loci (r), and the number of loci involved (n). Simple scaling arguments suggest that the behavior of the system should depend on the ratio of selection to recombination (θ = s/r), and on n. This is borne out by mathematical analysis of two demes which exchange individuals at a low rate; when selection is stronger than recombination (θ > 1), the effective selection on each locus is comparable to the total selection over the whole genome (s* ∼ ns). When selection is weaker than recombination (θ < 1), the effective selection is much weaker, but is still stronger than the selection on each locus alone (s* \\sim sn20 for small θ). When n is very large, these two regimes are separated by a sharp threshold at θ = 1. The results are extended to two taxa which meet in a continuous habitat; the effective selection pressure, which determines the width of the hybrid zone, behaves in the same way as for the simpler case above. Even when selection is weak compared to recombination, multilocus clines have a sharp step at their center, flanked by tails of introgression in which the alleles behave independently of each other. The set of clines acts as a barrier to gene flow, and it is shown that the barrier is strongest when selection is spread over many loci. The implications of the results for divergence and speciation are discussed.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2022-08-19T07:08:29Z","type":"journal_article","volume":37,"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","page":"454 - 471","extern":"1","publisher":"Society for the Study of Evolution","day":"01","_id":"3668","article_type":"original","title":"Multilocus clines","quality_controlled":"1","external_id":{"pmid":["28563316 "]},"doi":"10.2307/2408260","oa_version":"None","pmid":1,"publication":"Evolution; International Journal of Organic Evolution","acknowledgement":"I would like to thank G. Hewitt, J. Raper, M. Shaw, P. Oliver, M. Slatkin, J. Felsenstein, and D. J. Futuyma for their\r\n helpful comments. This work was partly supported by an SRC Post-Doctoral Fellowship.","article_processing_charge":"No","date_published":"1983-05-01T00:00:00Z","main_file_link":[{"url":"http://www.jstor.org/stable/2408260"}],"publication_status":"published","author":[{"last_name":"Barton","first_name":"Nicholas H","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"}],"intvolume":"        37","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"publist_id":"2715","date_created":"2018-12-11T12:04:31Z","status":"public","month":"05","year":"1983"},{"date_created":"2018-12-11T12:07:04Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"intvolume":"       154","publist_id":"1996","year":"1983","status":"public","month":"01","series_title":"LNCS","date_published":"1983-01-01T00:00:00Z","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007%2FBFb0036908"}],"publication_status":"published","publication":"International Colloquium on Automata, Languages, and Programming","article_processing_charge":"No","scopus_import":"1","alternative_title":["LNCS"],"title":"On the number of equal-sized semispaces of a set of points in the plane","quality_controlled":"1","doi":"10.1007/BFb0036908","oa_version":"None","day":"01","publisher":"Springer","extern":"1","_id":"4124","page":"182 - 187","date_updated":"2022-01-25T13:42:40Z","language":[{"iso":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","keyword":["Voronoi diagram","Asymptotic bound","Straightforward counting","Affine trans","Neighbor Voronoi diagram"],"type":"conference","volume":154,"conference":{"start_date":"1983-07-18","location":"Barcelona, Spain","name":"ICALP: Automata, Languages and Programming","end_date":"1983-07-22"},"citation":{"ieee":"H. Edelsbrunner and E. Welzl, “On the number of equal-sized semispaces of a set of points in the plane,” in <i>International Colloquium on Automata, Languages, and Programming</i>, Barcelona, Spain, 1983, vol. 154, pp. 182–187.","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces of a Set of Points in the Plane.” In <i>International Colloquium on Automata, Languages, and Programming</i>, 154:182–87. LNCS. Springer, 1983. <a href=\"https://doi.org/10.1007/BFb0036908\">https://doi.org/10.1007/BFb0036908</a>.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1983). On the number of equal-sized semispaces of a set of points in the plane. In <i>International Colloquium on Automata, Languages, and Programming</i> (Vol. 154, pp. 182–187). Barcelona, Spain: Springer. <a href=\"https://doi.org/10.1007/BFb0036908\">https://doi.org/10.1007/BFb0036908</a>","ista":"Edelsbrunner H, Welzl E. 1983. On the number of equal-sized semispaces of a set of points in the plane. International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and ProgrammingLNCS, LNCS, vol. 154, 182–187.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Equal-Sized Semispaces of a Set of Points in the Plane.” <i>International Colloquium on Automata, Languages, and Programming</i>, vol. 154, Springer, 1983, pp. 182–87, doi:<a href=\"https://doi.org/10.1007/BFb0036908\">10.1007/BFb0036908</a>.","ama":"Edelsbrunner H, Welzl E. On the number of equal-sized semispaces of a set of points in the plane. In: <i>International Colloquium on Automata, Languages, and Programming</i>. Vol 154. LNCS. Springer; 1983:182-187. doi:<a href=\"https://doi.org/10.1007/BFb0036908\">10.1007/BFb0036908</a>","short":"H. Edelsbrunner, E. Welzl, in:, International Colloquium on Automata, Languages, and Programming, Springer, 1983, pp. 182–187."}},{"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0031320384900645?via%3Dihub"}],"date_published":"1983-07-01T00:00:00Z","publication_status":"published","publication_identifier":{"eissn":["1873-5142"],"issn":["0031-3203"]},"intvolume":"        17","publist_id":"1997","author":[{"full_name":"Aurenhammer, Franz","first_name":"Franz","last_name":"Aurenhammer"},{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"date_created":"2018-12-11T12:07:05Z","month":"07","status":"public","year":"1983","quality_controlled":"1","title":"An optimal algorithm for constructing the weighted Voronoi diagram in the plane","scopus_import":"1","oa_version":"None","doi":"10.1016/0031-3203(84)90064-5","publication":"Pattern Recognition","acknowledgement":"The second author gratefully acknowledges discussions on the presented topic with David Kirkpatrick and Raimund Seidel.","article_processing_charge":"No","page":"251 - 257","extern":"1","day":"01","publisher":"Elsevier","article_type":"original","_id":"4125","issue":"2","citation":{"mla":"Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” <i>Pattern Recognition</i>, vol. 17, no. 2, Elsevier, 1983, pp. 251–57, doi:<a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">10.1016/0031-3203(84)90064-5</a>.","short":"F. Aurenhammer, H. Edelsbrunner, Pattern Recognition 17 (1983) 251–257.","ama":"Aurenhammer F, Edelsbrunner H. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. <i>Pattern Recognition</i>. 1983;17(2):251-257. doi:<a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">10.1016/0031-3203(84)90064-5</a>","apa":"Aurenhammer, F., &#38; Edelsbrunner, H. (1983). An optimal algorithm for constructing the weighted Voronoi diagram in the plane. <i>Pattern Recognition</i>. Elsevier. <a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">https://doi.org/10.1016/0031-3203(84)90064-5</a>","chicago":"Aurenhammer, Franz, and Herbert Edelsbrunner. “An Optimal Algorithm for Constructing the Weighted Voronoi Diagram in the Plane.” <i>Pattern Recognition</i>. Elsevier, 1983. <a href=\"https://doi.org/10.1016/0031-3203(84)90064-5\">https://doi.org/10.1016/0031-3203(84)90064-5</a>.","ieee":"F. Aurenhammer and H. Edelsbrunner, “An optimal algorithm for constructing the weighted Voronoi diagram in the plane,” <i>Pattern Recognition</i>, vol. 17, no. 2. Elsevier, pp. 251–257, 1983.","ista":"Aurenhammer F, Edelsbrunner H. 1983. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition. 17(2), 251–257."},"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Let S denote a set of n points in the plane such that each point p has assigned a positive weight w(p) which expresses its capability to influence its neighbourhood. In this sense, the weighted distance of an arbitrary point x from p is given by de(x,p)/w(p) where de denotes the Euclidean distance function. The weighted Voronoi diagram for S is a subdivision of the plane such that each point p in S is associated with a region consisting of all points x in the plane for which p is a weighted nearest point of S.\r\n\r\nAn algorithm which constructs the weighted Voronoi diagram for S in O(n2) time is outlined in this paper. The method is optimal as the diagram can consist of Θ(n2) faces, edges and vertices.\r\n"}],"date_updated":"2022-01-27T14:06:27Z","type":"journal_article","volume":17,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"doi":"10.1080/00207168308803364","oa_version":"None","quality_controlled":"1","title":"A new approach to rectangle intersections part 1","scopus_import":"1","article_processing_charge":"No","publication":"International Journal of Computer Mathematics","publication_status":"published","date_published":"1983-09-01T00:00:00Z","month":"09","status":"public","year":"1983","publist_id":"1993","intvolume":"        13","publication_identifier":{"issn":["0020-7160"],"eissn":["1029-0265"]},"author":[{"orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"}],"date_created":"2018-12-11T12:07:05Z","citation":{"mla":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4, Taylor &#38; Francis, 1983, pp. 209–19, doi:<a href=\"https://doi.org/10.1080/00207168308803364\">10.1080/00207168308803364</a>.","ama":"Edelsbrunner H. A new approach to rectangle intersections part 1. <i>International Journal of Computer Mathematics</i>. 1983;13(3-4):209-219. doi:<a href=\"https://doi.org/10.1080/00207168308803364\">10.1080/00207168308803364</a>","short":"H. Edelsbrunner, International Journal of Computer Mathematics 13 (1983) 209–219.","chicago":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 1.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1983. <a href=\"https://doi.org/10.1080/00207168308803364\">https://doi.org/10.1080/00207168308803364</a>.","ieee":"H. Edelsbrunner, “A new approach to rectangle intersections part 1,” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4. Taylor &#38; Francis, pp. 209–219, 1983.","apa":"Edelsbrunner, H. (1983). A new approach to rectangle intersections part 1. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207168308803364\">https://doi.org/10.1080/00207168308803364</a>","ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 1. International Journal of Computer Mathematics. 13(3–4), 209–219."},"issue":"3-4","volume":13,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"Rectangle intersections involving rectilinearly-oriented (hyper-) rectangles in d-dimensional real space are examined from two points of view. First, a data structure is developed which is efficient in time and space and allows us to report all d-dimensional rectangles stored which intersect a d-dimensional query rectangle. Second, in Part II, a slightly modified version of this new data structure is applied to report all intersecting pairs of rectangles of a given set. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions."}],"date_updated":"2022-01-25T12:21:18Z","page":"209 - 219","article_type":"original","_id":"4126","extern":"1","publisher":"Taylor & Francis","day":"01"},{"date_published":"1983-09-01T00:00:00Z","publication_status":"published","date_created":"2018-12-11T12:07:06Z","intvolume":"        13","publication_identifier":{"issn":["0020-7160"],"eissn":["1029-0265"]},"publist_id":"1994","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"year":"1983","month":"09","status":"public","scopus_import":"1","quality_controlled":"1","title":"A new approach to rectangle intersections part 2","doi":"10.1080/00207168308803365","oa_version":"None","publication":"International Journal of Computer Mathematics","article_processing_charge":"No","page":"221 - 229","publisher":"Taylor & Francis","day":"01","extern":"1","_id":"4127","article_type":"original","issue":"3-4","citation":{"short":"H. Edelsbrunner, International Journal of Computer Mathematics 13 (1983) 221–229.","ama":"Edelsbrunner H. A new approach to rectangle intersections part 2. <i>International Journal of Computer Mathematics</i>. 1983;13(3-4):221-229. doi:<a href=\"https://doi.org/10.1080/00207168308803365\">10.1080/00207168308803365</a>","mla":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4, Taylor &#38; Francis, 1983, pp. 221–29, doi:<a href=\"https://doi.org/10.1080/00207168308803365\">10.1080/00207168308803365</a>.","ista":"Edelsbrunner H. 1983. A new approach to rectangle intersections part 2. International Journal of Computer Mathematics. 13(3–4), 221–229.","apa":"Edelsbrunner, H. (1983). A new approach to rectangle intersections part 2. <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00207168308803365\">https://doi.org/10.1080/00207168308803365</a>","chicago":"Edelsbrunner, Herbert. “A New Approach to Rectangle Intersections Part 2.” <i>International Journal of Computer Mathematics</i>. Taylor &#38; Francis, 1983. <a href=\"https://doi.org/10.1080/00207168308803365\">https://doi.org/10.1080/00207168308803365</a>.","ieee":"H. Edelsbrunner, “A new approach to rectangle intersections part 2,” <i>International Journal of Computer Mathematics</i>, vol. 13, no. 3–4. Taylor &#38; Francis, pp. 221–229, 1983."},"date_updated":"2022-01-25T12:33:10Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The study begun in Part I is completed by providing an algorithm which reports all intersecting pairs of a set of rectangles in d dimensions. This approach yields a solution which is optimal in time and space for planar rectangles and reasonable in higher dimensions."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":13},{"oa_version":"None","doi":"10.1109/TIT.1983.1056714 ","title":"On the shape of a set of points in the plane","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","publication":"IEEE Transactions on Information Theory","acknowledgement":"The authors express their appreciation for numerous constructive suggestions, which led to improvements on\r\nvarious phases of the manuscript, to Dr. Marvin Simon of JPL and to Professor George L. Turin of University of\r\nCalifornia, Berkeley. The junior author also gratefully acknowledges the role of the latter as her M.S. research\r\nadvisor on the project which formed the nucleus of this work. \r\n","publication_status":"published","date_published":"1983-06-01T00:00:00Z","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/1056714"}],"status":"public","month":"06","year":"1983","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"full_name":"Kirkpatrick, David","first_name":"David","last_name":"Kirkpatrick"},{"first_name":"Raimund","last_name":"Seidel","full_name":"Seidel, Raimund"}],"publist_id":"1995","publication_identifier":{"issn":["0018-9162"],"eissn":["1558-0814"]},"intvolume":"        29","date_created":"2018-12-11T12:07:06Z","citation":{"ista":"Edelsbrunner H, Kirkpatrick D, Seidel R. 1983. On the shape of a set of points in the plane. IEEE Transactions on Information Theory. 29(4), 551–559.","apa":"Edelsbrunner, H., Kirkpatrick, D., &#38; Seidel, R. (1983). On the shape of a set of points in the plane. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">https://doi.org/10.1109/TIT.1983.1056714 </a>","ieee":"H. Edelsbrunner, D. Kirkpatrick, and R. Seidel, “On the shape of a set of points in the plane,” <i>IEEE Transactions on Information Theory</i>, vol. 29, no. 4. IEEE, pp. 551–559, 1983.","chicago":"Edelsbrunner, Herbert, David Kirkpatrick, and Raimund Seidel. “On the Shape of a Set of Points in the Plane.” <i>IEEE Transactions on Information Theory</i>. IEEE, 1983. <a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">https://doi.org/10.1109/TIT.1983.1056714 </a>.","short":"H. Edelsbrunner, D. Kirkpatrick, R. Seidel, IEEE Transactions on Information Theory 29 (1983) 551–559.","ama":"Edelsbrunner H, Kirkpatrick D, Seidel R. On the shape of a set of points in the plane. <i>IEEE Transactions on Information Theory</i>. 1983;29(4):551-559. doi:<a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">10.1109/TIT.1983.1056714 </a>","mla":"Edelsbrunner, Herbert, et al. “On the Shape of a Set of Points in the Plane.” <i>IEEE Transactions on Information Theory</i>, vol. 29, no. 4, IEEE, 1983, pp. 551–59, doi:<a href=\"https://doi.org/10.1109/TIT.1983.1056714 \">10.1109/TIT.1983.1056714 </a>."},"issue":"4","type":"journal_article","volume":29,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"A generalization of the convex hull of a finite set of points in the plane is introduced and analyzed. This generalization leads to a family of straight-line graphs, \" \\alpha -shapes,\" which seem to capture the intuitive notions of \"fine shape\" and \"crude shape\" of point sets. It is shown that a-shapes are subgraphs of the closest point or furthest point Delaunay triangulation. Relying on this result an optimal O(n \\log n) algorithm that constructs \\alpha -shapes is developed."}],"language":[{"iso":"eng"}],"date_updated":"2022-01-25T12:55:07Z","page":"551 - 559","article_type":"original","_id":"4128","extern":"1","publisher":"IEEE","day":"01"},{"date_published":"1983-01-01T00:00:00Z","publication_status":"published","editor":[{"full_name":"Oxford, Geoffrey","last_name":"Oxford","first_name":"Geoffrey"},{"first_name":"David","last_name":"Rollinson","full_name":"Rollinson, David"}],"date_created":"2018-12-11T12:08:17Z","publication_identifier":{"isbn":["978-0-1253-1780-1"],"issn":["0309-2593"]},"publist_id":"1710","intvolume":"        24","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"},{"first_name":"Godfrey","last_name":"Hewitt","full_name":"Hewitt, Godfrey"}],"year":"1983","month":"01","status":"public","alternative_title":["Systematics Association Special Volume"],"quality_controlled":"1","title":"Hybrid zones as barriers to gene flow","oa_version":"None","publication":"Protein polymorphism: Adaptive and taxonomic significance","article_processing_charge":"No","page":"341 - 359","publisher":"Academic Press","day":"01","extern":"1","_id":"4328","conference":{"location":"University of York, United Kingdom","name":"SystAss: Systematics Association","end_date":"1982-07-15","start_date":"1982-07-13"},"citation":{"mla":"Barton, Nicholas H., and Godfrey Hewitt. “Hybrid Zones as Barriers to Gene Flow.” <i>Protein Polymorphism: Adaptive and Taxonomic Significance</i>, edited by Geoffrey Oxford and David Rollinson, vol. 24, Academic Press, 1983, pp. 341–59.","ama":"Barton NH, Hewitt G. Hybrid zones as barriers to gene flow. In: Oxford G, Rollinson D, eds. <i>Protein Polymorphism: Adaptive and Taxonomic Significance</i>. Vol 24. Academic Press; 1983:341-359.","short":"N.H. Barton, G. Hewitt, in:, G. Oxford, D. Rollinson (Eds.), Protein Polymorphism: Adaptive and Taxonomic Significance, Academic Press, 1983, pp. 341–359.","ieee":"N. H. Barton and G. Hewitt, “Hybrid zones as barriers to gene flow,” in <i>Protein polymorphism: Adaptive and taxonomic significance</i>, vol. 24, G. Oxford and D. Rollinson, Eds. Academic Press, 1983, pp. 341–359.","chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Hybrid Zones as Barriers to Gene Flow.” In <i>Protein Polymorphism: Adaptive and Taxonomic Significance</i>, edited by Geoffrey Oxford and David Rollinson, 24:341–59. Academic Press, 1983.","apa":"Barton, N. H., &#38; Hewitt, G. (1983). Hybrid zones as barriers to gene flow. In G. Oxford &#38; D. Rollinson (Eds.), <i>Protein polymorphism: Adaptive and taxonomic significance</i> (Vol. 24, pp. 341–359). University of York, United Kingdom: Academic Press.","ista":"Barton NH, Hewitt G. 1983.Hybrid zones as barriers to gene flow. In: Protein polymorphism: Adaptive and taxonomic significance. Systematics Association Special Volume, vol. 24, 341–359."},"date_updated":"2022-01-24T11:05:31Z","language":[{"iso":"eng"}],"abstract":[{"text":"The hybrid zone which forms when two partially incompatible populations meet acts as a barrier to gene flow. We discuss electrophoretic and theoretical evidence on the strength of such barriers. Hybrid zones generally involve considerable electrophoretic divergence. The enzyme clines are consistent in position and width; in some cases, they show consistently asymmetric patterns of introgression. This consistency suggests that the clines are maintained primarily by the indirect effects of selection at linked loci, rather than by the effect of each individual locus on fitness. A cline at a single locus will present some barrier, regardless of the selective mechanism which maintains it. However, unless the locus induces virtually complete assortment or hybrid unfitness, the barrier will be weak. Spreading the same selection over more clines gives a stronger barrier. If the clines are staggered, this barrier is still unlikely to be significant; if they coincide, and if selection is stronger than recombination, then the barrier will be very strong; its strength and asymmetry will be consistent over different loci. Thus, the taxonomic status of divergent populations cannot be inferred just from the total amount of pre- or post-mating isolation; the number of genetic differences, and the interactions between them are equally important in determining rates of gene flow.","lang":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","volume":24,"type":"book_chapter","keyword":["chemotaxonomy"]},{"intvolume":"        31","publist_id":"1708","publication_identifier":{"eissn":["1095-8282"],"issn":["0003-3472"]},"author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton"}],"extern":"1","publisher":"Elsevier","day":"01","date_created":"2018-12-11T12:08:17Z","month":"05","_id":"4329","status":"public","year":"1983","date_published":"1983-05-01T00:00:00Z","publication_status":"published","page":"626 - 627","language":[{"iso":"eng"}],"publication":"Animal Behaviour","date_updated":"2022-01-21T12:47:05Z","article_processing_charge":"No","type":"review","volume":31,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","quality_controlled":"1","title":"The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982)","issue":"2","oa_version":"None","doi":"10.1016/S0003-3472(83)80100-6","citation":{"short":"N.H. Barton, Animal Behaviour 31 (1983) 626–627.","ama":"Barton NH. The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982). <i>Animal Behaviour</i>. 1983;31(2):626-627. doi:<a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">10.1016/S0003-3472(83)80100-6</a>","mla":"Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection (Review of Dawkins R 1982).” <i>Animal Behaviour</i>, vol. 31, no. 2, Elsevier, 1983, pp. 626–27, doi:<a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">10.1016/S0003-3472(83)80100-6</a>.","ista":"Barton NH. 1983. The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982). Animal Behaviour. 31(2), 626–627.","apa":"Barton, N. H. (1983). The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982). <i>Animal Behaviour</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">https://doi.org/10.1016/S0003-3472(83)80100-6</a>","chicago":"Barton, Nicholas H. “The Extended Phenotype: The Gene as the Unit of Selection (Review of Dawkins R 1982).” <i>Animal Behaviour</i>. Elsevier, 1983. <a href=\"https://doi.org/10.1016/S0003-3472(83)80100-6\">https://doi.org/10.1016/S0003-3472(83)80100-6</a>.","ieee":"N. H. Barton, “The extended phenotype: the gene as the unit of selection (review of Dawkins R 1982),” <i>Animal Behaviour</i>, vol. 31, no. 2. Elsevier, pp. 626–627, 1983."}},{"date_published":"1983-04-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198324"}],"page":"213 - 213","publication_status":"published","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"intvolume":"        50","publist_id":"1704","extern":"1","author":[{"orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton"}],"publisher":"Springer Nature","day":"01","date_created":"2018-12-11T12:08:17Z","month":"04","_id":"4330","status":"public","year":"1983","place":"University College of London","quality_controlled":"1","title":"Gene flow and speciation (abstract)","doi":"10.1038/hdy.1983.24","citation":{"apa":"Barton, N. H. (1983). Gene flow and speciation (abstract). <i>Heredity</i>. University College of London: Springer Nature. <a href=\"https://doi.org/10.1038/hdy.1983.24\">https://doi.org/10.1038/hdy.1983.24</a>","ieee":"N. H. Barton, “Gene flow and speciation (abstract),” <i>Heredity</i>, vol. 50. Springer Nature, University College of London, pp. 213–213, 1983.","chicago":"Barton, Nicholas H. “Gene Flow and Speciation (Abstract).” <i>Heredity</i>. University College of London: Springer Nature, 1983. <a href=\"https://doi.org/10.1038/hdy.1983.24\">https://doi.org/10.1038/hdy.1983.24</a>.","ista":"Barton NH. 1983. Gene flow and speciation (abstract). Heredity. 50, 213–213.","mla":"Barton, Nicholas H. “Gene Flow and Speciation (Abstract).” <i>Heredity</i>, vol. 50, Springer Nature, 1983, pp. 213–213, doi:<a href=\"https://doi.org/10.1038/hdy.1983.24\">10.1038/hdy.1983.24</a>.","short":"N.H. Barton, Heredity 50 (1983) 213–213.","ama":"Barton NH. Gene flow and speciation (abstract). <i>Heredity</i>. 1983;50:213-213. doi:<a href=\"https://doi.org/10.1038/hdy.1983.24\">10.1038/hdy.1983.24</a>"},"oa_version":"Published Version","language":[{"iso":"eng"}],"publication":"Heredity","date_updated":"2022-01-21T12:38:10Z","type":"review","article_processing_charge":"No","volume":50,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa":1},{"page":"237 - 249","_id":"3669","article_type":"original","extern":"1","publisher":"Springer Nature","day":"01","citation":{"ista":"Barton NH, Hewitt G. 1982. A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). Heredity. 48(2), 237–249.","ieee":"N. H. Barton and G. Hewitt, “A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae),” <i>Heredity</i>, vol. 48, no. 2. Springer Nature, pp. 237–249, 1982.","chicago":"Barton, Nicholas H, and Godfrey Hewitt. “A Measurement of Dispersal in the Grasshopper Podisma Pedestris (Orthoptera: Acrididae).” <i>Heredity</i>. Springer Nature, 1982. <a href=\"https://doi.org/10.1038/hdy.1982.29\">https://doi.org/10.1038/hdy.1982.29</a>.","apa":"Barton, N. H., &#38; Hewitt, G. (1982). A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). <i>Heredity</i>. Springer Nature. <a href=\"https://doi.org/10.1038/hdy.1982.29\">https://doi.org/10.1038/hdy.1982.29</a>","ama":"Barton NH, Hewitt G. A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae). <i>Heredity</i>. 1982;48(2):237-249. doi:<a href=\"https://doi.org/10.1038/hdy.1982.29\">10.1038/hdy.1982.29</a>","short":"N.H. Barton, G. Hewitt, Heredity 48 (1982) 237–249.","mla":"Barton, Nicholas H., and Godfrey Hewitt. “A Measurement of Dispersal in the Grasshopper Podisma Pedestris (Orthoptera: Acrididae).” <i>Heredity</i>, vol. 48, no. 2, Springer Nature, 1982, pp. 237–49, doi:<a href=\"https://doi.org/10.1038/hdy.1982.29\">10.1038/hdy.1982.29</a>."},"issue":"2","type":"journal_article","volume":48,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"The dispersal rate of the grasshopper Podisma pedestris has been measured, with the aim of interpreting the width of a chromosomal cline. 171 adults were marked individually, and released within the cline. 169 movements were seen over three subsequent scorings; the distribution of distances, after correction for the loss of long distance dispersants, was close to a normal curve, but there was an initial shift of ten metres, perhaps towards a better habitat. The linear variance increased at about 214 m2 day- 1, which corresponds to a standard deviation of 207 m gen- 1/2 over a 20 day life span. Statistical uncertainty in this estimate can be expressed using a distribution-free maximum likelihood method, which gives support limits of 186- 270 m gen- 1/2. However, the main errors come from extrapolating from this experiment to the cline as a whole."}],"date_updated":"2022-01-21T12:31:06Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198229"}],"date_published":"1982-04-01T00:00:00Z","month":"04","status":"public","year":"1982","publication_identifier":{"issn":["0018-067X"],"eissn":["1365-2540"]},"publist_id":"2714","intvolume":"        48","author":[{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Hewitt, Godfrey","last_name":"Hewitt","first_name":"Godfrey"}],"date_created":"2018-12-11T12:04:32Z","oa_version":"Published Version","doi":"10.1038/hdy.1982.29","quality_controlled":"1","title":"A measurement of dispersal in the grasshopper Podisma pedestris (Orthoptera: Acrididae)","article_processing_charge":"No","publication":"Heredity","acknowledgement":"We are grateful for the help in the field of Bruce and Helen Halliday, James, Matthew, Daniel and Elizabeth Hewitt, and for the hospitality of M et Mme Aviotti. This work was supported by an N.E.R.C. Studentship to the first author, and an S.R.C. research grant to the second.\r\n"}]