[{"citation":{"ista":"Szymura J, Barton NH. 1986. Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. Evolution; International Journal of Organic Evolution. 40, 1141–1159.","mla":"Szymura, Jacek, and Nicholas H. Barton. “Genetic Analysis of a Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata, near Cracow in Southern Poland.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 40, Society for the Study of Evolution, 1986, pp. 1141–59, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">10.1111/j.1558-5646.1986.tb05740.x</a>.","short":"J. Szymura, N.H. Barton, Evolution; International Journal of Organic Evolution 40 (1986) 1141–1159.","ama":"Szymura J, Barton NH. Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. <i>Evolution; International Journal of Organic Evolution</i>. 1986;40:1141-1159. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">10.1111/j.1558-5646.1986.tb05740.x</a>","apa":"Szymura, J., &#38; Barton, N. H. (1986). Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland. <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution. <a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">https://doi.org/10.1111/j.1558-5646.1986.tb05740.x</a>","ieee":"J. Szymura and N. H. Barton, “Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 40. Society for the Study of Evolution, pp. 1141–1159, 1986.","chicago":"Szymura, Jacek, and Nicholas H Barton. “Genetic Analysis of a Hybrid Zone between the Fire-Bellied Toads Bombina Bombina and B. Variegata, near Cracow in Southern Poland.” <i>Evolution; International Journal of Organic Evolution</i>. Society for the Study of Evolution, 1986. <a href=\"https://doi.org/10.1111/j.1558-5646.1986.tb05740.x\">https://doi.org/10.1111/j.1558-5646.1986.tb05740.x</a>."},"month":"01","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1558-5646"],"issn":["0014-3820"]},"status":"public","acknowledgement":"We are grateful to J. Mitton and W. P. Hall for their suggestions and help with earlier versions of the statistical analysis. The manuscript was much improved by the helpful comments of Dorothy Currie, Gunther Gollmann, Godfrey Hewitt, Julian MacLean, and Jim Mallet. Thanks are also due to Tina Tsang for her careful typing. This work was supported by  the Exchange Agreement between the Polish Academy of Sciences and the Royal Society, and by grants from the Polish Academy of Sciences (project MR-II/6), the Royal Society, the Nuffield Foundation, and the  Science and Engineering Research Council. ","day":"01","article_type":"original","_id":"4321","intvolume":"        40","year":"1986","publication_status":"published","volume":40,"page":"1141 - 1159","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","abstract":[{"text":"The fire-bellied toads Bombina bombina and B. variegata differ extensively in biochemistry, morphology, and behavior. We use a survey of five diagnostic enzyme loci across the hybrid zone near Cracow in Southern Poland to estimate the dispersal rate, selection pressures, and numbers of loci which maintain this zone. The enzyme clines coincide closely with each other and with morphological and mitochondrial DNA clines. Although the zone lies on a broad transition between environments suitable for bombina and variegata, the close concordance of diverse characters, together with increased aberrations and mortality in hybrids, suggest that the zone is maintained largely by selection against hybrids. There are strong “linkage disequilibria” between each pair of (unlinked) enzyme loci (R̄ = 0.129 [2-unit support limits: 0.119–0.139]). These are probably caused by gene flow into the zone, and they give an estimate of dispersal (σ = 890 [790–940] m gen−½). The clines are sharply stepped, with most of the change occurring within 6.15 (5.45–6.45) km, but with long tails of introgression on either side. This implies that the effective selection pressure on each enzyme marker (due largely to disequilibrium with other loci) is s* = 0.17 (0.159–0.181) at the center but that the selection acting directly on the enzyme loci is weak or zero (se < 0.0038). The stepped pattern implies a barrier to gene flow of 220 (48–415) km. This would substantially delay neutral introgression but would have little effect on advantageous alleles; the two taxa need not evolve independently. Strong selection is needed to maintain such a barrier: hybrid populations must have their mean fitness reduced by a factor of 0.65 (0.60–0.77). This selection must be spread over a large number of loci to account for the concordant patterns and the observed cline widths (N = 300 [80–2,000]).","lang":"eng"}],"extern":"1","quality_controlled":"1","date_published":"1986-01-01T00:00:00Z","author":[{"full_name":"Szymura, Jacek","last_name":"Szymura","first_name":"Jacek"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"}],"article_processing_charge":"No","date_updated":"2022-01-31T15:31:37Z","doi":"10.1111/j.1558-5646.1986.tb05740.x","date_created":"2018-12-11T12:08:14Z","oa_version":"None","publist_id":"1724","publication":"Evolution; International Journal of Organic Evolution","title":"Genetic analysis of a hybrid zone between the fire-bellied toads Bombina bombina and B. variegata, near Cracow in Southern Poland","publisher":"Society for the Study of Evolution"},{"date_created":"2018-12-11T12:08:15Z","oa_version":"None","publist_id":"1720","publication":"Journal of Theoretical Biology","title":"Sibling competition and the advantage of mixed families","publisher":"Elsevier","abstract":[{"text":"It is noted that the sibling competition model for the evolution of sex and recombination, as it has been developed so far, involves truncation selection. After briefly reviewing aspects of the development and behaviour of such models an analytical treatment is presented which involves additive selection. Additive selection, as compared with truncation selection, decreases the advantage of sex to such an extent that it is unlikely that sibling competition could overcome its intrinsic two-fold cost, although it could still be important in promoting family variability produced by other mechanisms, such as polyandry.","lang":"eng"}],"extern":"1","_id":"4323","year":"1986","volume":120,"page":"381 - 387","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","citation":{"chicago":"Barton, Nicholas H, and R.J. Post. “Sibling Competition and the Advantage of Mixed Families.” <i>Journal of Theoretical Biology</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">https://doi.org/10.1016/S0022-5193(86)80033-9</a>.","ieee":"N. H. Barton and R. J. Post, “Sibling competition and the advantage of mixed families,” <i>Journal of Theoretical Biology</i>, vol. 120, no. 4. Elsevier, pp. 381–387, 1986.","apa":"Barton, N. H., &#38; Post, R. J. (1986). Sibling competition and the advantage of mixed families. <i>Journal of Theoretical Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">https://doi.org/10.1016/S0022-5193(86)80033-9</a>","ama":"Barton NH, Post RJ. Sibling competition and the advantage of mixed families. <i>Journal of Theoretical Biology</i>. 1986;120(4):381-387. doi:<a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">10.1016/S0022-5193(86)80033-9</a>","ista":"Barton NH, Post RJ. 1986. Sibling competition and the advantage of mixed families. Journal of Theoretical Biology. 120(4), 381–387.","short":"N.H. Barton, R.J. Post, Journal of Theoretical Biology 120 (1986) 381–387.","mla":"Barton, Nicholas H., and R. J. Post. “Sibling Competition and the Advantage of Mixed Families.” <i>Journal of Theoretical Biology</i>, vol. 120, no. 4, Elsevier, 1986, pp. 381–87, doi:<a href=\"https://doi.org/10.1016/S0022-5193(86)80033-9\">10.1016/S0022-5193(86)80033-9</a>."},"publication_identifier":{"issn":["0022-5193"],"eissn":["1095-8541"]},"acknowledgement":"We would like to thank M. Bulmer for his helpful comments. R. J. Post was supported during this work by an MRC Postdoctoral Fellowship, and N. Barton by an SRC Postdoctoral Fellowship. \r\n","status":"public","issue":"4","article_type":"original","quality_controlled":"1","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"},{"first_name":"R.J.","last_name":"Post","full_name":"Post, R.J."}],"date_published":"1986-06-21T00:00:00Z","article_processing_charge":"No","date_updated":"2022-01-31T14:44:50Z","doi":"10.1016/S0022-5193(86)80033-9","intvolume":"       120","publication_status":"published","month":"06","language":[{"iso":"eng"}],"day":"21"},{"abstract":[{"lang":"eng","text":"The maintenance of polygenic variation through a balance between mutation and stabilizing selection can be approximated in two ways. In the ‘Gaussian’ approximation, a normal distribution of allelic effects is assumed at each locus. In the ‘House of Cards’ approximation, the effect of new mutations is assumed to be large compared with the spread of the existing distribution. These approximations were developed to describe models where alleles may have a continuous range of effects. However, previous analyses of models with only two alleles have predicted an equilibrium variance equal to that given by the ‘House of Cards’ approximation. These analyses of biallelic models have assumed that, at equilibrium, the population mean is at the optimum. Here, it is shown that many stable equilibria may coexist, each giving a slight deviation from the optimum. Though the variance is given by the ‘House of Cards’ approximation when the mean is at the optimum, it increases towards a value of the same order as that given by the ‘Gaussian’ approximation when the mean deviates from the optimum. Thus, the equilibrium variance cannot be predicted by any simple model, but depends on the previous history of the population."}],"extern":"1","title":"The maintenance of polygenic variation through a balance between mutation and stabilising selection","publication":"Genetical Research","publisher":"Cambridge University Press","oa_version":"None","date_created":"2018-12-11T12:08:15Z","publist_id":"1718","acknowledgement":"Thanks are due to J. Felsenstein, J. Gillespie, S. Rouhani, M. Slatkin, and M. Turelli for stimulating discussions, and for their comments on the manuscript. This work was sup- ported by a travel grant from the Royal Society, and by a research grant from the SERC","status":"public","article_type":"original","external_id":{"pmid":["3744046"]},"issue":"3","citation":{"short":"N.H. Barton, Genetical Research 47 (1986) 209–216.","ista":"Barton NH. 1986. The maintenance of polygenic variation through a balance between mutation and stabilising selection. Genetical Research. 47(3), 209–216.","mla":"Barton, Nicholas H. “The Maintenance of Polygenic Variation through a Balance between Mutation and Stabilising Selection.” <i>Genetical Research</i>, vol. 47, no. 3, Cambridge University Press, 1986, pp. 209–16, doi:<a href=\"https://doi.org/10.1017/S0016672300023156\">10.1017/S0016672300023156</a>.","ama":"Barton NH. The maintenance of polygenic variation through a balance between mutation and stabilising selection. <i>Genetical Research</i>. 1986;47(3):209-216. doi:<a href=\"https://doi.org/10.1017/S0016672300023156\">10.1017/S0016672300023156</a>","apa":"Barton, N. H. (1986). The maintenance of polygenic variation through a balance between mutation and stabilising selection. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300023156\">https://doi.org/10.1017/S0016672300023156</a>","chicago":"Barton, Nicholas H. “The Maintenance of Polygenic Variation through a Balance between Mutation and Stabilising Selection.” <i>Genetical Research</i>. Cambridge University Press, 1986. <a href=\"https://doi.org/10.1017/S0016672300023156\">https://doi.org/10.1017/S0016672300023156</a>.","ieee":"N. H. Barton, “The maintenance of polygenic variation through a balance between mutation and stabilising selection,” <i>Genetical Research</i>, vol. 47, no. 3. Cambridge University Press, pp. 209–216, 1986."},"publication_identifier":{"eissn":["1469-5073"],"issn":["0016-6723"]},"page":"209 - 216","volume":47,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4324","year":"1986","date_published":"1986-06-01T00:00:00Z","author":[{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"date_updated":"2022-01-31T14:31:48Z","doi":"10.1017/S0016672300023156","article_processing_charge":"No","quality_controlled":"1","pmid":1,"day":"01","language":[{"iso":"eng"}],"month":"06","intvolume":"        47","publication_status":"published"},{"publication_status":"published","intvolume":"        21","month":"07","language":[{"iso":"eng"}],"day":"10","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","date_updated":"2022-01-31T12:49:12Z","doi":"10.1016/0020-0190(85)90107-3","date_published":"1985-07-10T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Maurer","first_name":"Hermann","full_name":"Maurer, Hermann"}],"year":"1985","_id":"4111","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":21,"page":"39 - 47","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"citation":{"chicago":"Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” <i>Information Processing Letters</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">https://doi.org/10.1016/0020-0190(85)90107-3</a>.","ieee":"H. Edelsbrunner and H. Maurer, “Finding extreme-points in 3-dimensions and solving the post-office problem in the plane,” <i>Information Processing Letters</i>, vol. 21, no. 1. Elsevier, pp. 39–47, 1985.","apa":"Edelsbrunner, H., &#38; Maurer, H. (1985). Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">https://doi.org/10.1016/0020-0190(85)90107-3</a>","ama":"Edelsbrunner H, Maurer H. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. <i>Information Processing Letters</i>. 1985;21(1):39-47. doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">10.1016/0020-0190(85)90107-3</a>","ista":"Edelsbrunner H, Maurer H. 1985. Finding extreme-points in 3-dimensions and solving the post-office problem in the plane. Information Processing Letters. 21(1), 39–47.","mla":"Edelsbrunner, Herbert, and Hermann Maurer. “Finding Extreme-Points in 3-Dimensions and Solving the Post-Office Problem in the Plane.” <i>Information Processing Letters</i>, vol. 21, no. 1, Elsevier, 1985, pp. 39–47, doi:<a href=\"https://doi.org/10.1016/0020-0190(85)90107-3\">10.1016/0020-0190(85)90107-3</a>.","short":"H. Edelsbrunner, H. Maurer, Information Processing Letters 21 (1985) 39–47."},"issue":"1","article_type":"original","acknowledgement":"Research reported in this paper was partially supported by the Austrian Fonds zur Förderung tier wissenschaftlichen\r\nForschung. \r\n","status":"public","publist_id":"2009","date_created":"2018-12-11T12:07:00Z","oa_version":"None","publisher":"Elsevier","publication":"Information Processing Letters","title":"Finding extreme-points in 3-dimensions and solving the post-office problem in the plane","extern":"1","abstract":[{"lang":"eng","text":"This paper describes an optimal solution for the following geometric search problem defined for a set P of n points in three dimensions: Given a plane h with all points of P on one side and a line ℓ in h, determine a point of P that is hit first when h is rotated around ℓ. The solution takes O(n) space and O(log n) time for a query. By use of geometric transforms, the post-office problem for a finite set of points in two dimensions and certain two-dimensional point location problems are reduced to the former problem and thus also optimally solved."}]},{"scopus_import":"1","quality_controlled":"1","date_published":"1985-12-01T00:00:00Z","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mark","last_name":"Overmars","full_name":"Overmars, Mark"}],"date_updated":"2022-01-31T13:36:56Z","doi":"10.1016/0196-6774(85)90030-6","article_processing_charge":"No","language":[{"iso":"eng"}],"month":"12","day":"01","intvolume":"         6","publication_status":"published","abstract":[{"lang":"eng","text":"The batched static version of a searching problem asks for performing a given set of queries on a given set of objects. All queries are known in advance. The batched dynamic version of a searching problem is the following: given a sequence of insertions, deletions, and queries, perform them on an initially empty set. We will develop methods for solving batched static and batched dynamic versions of searching problems which are in particular applicable to decomposable searching problems. The techniques show that batched static (dynamic) versions of searching problems can often be solved more efficiently than by using known static (dynamic) data structures. In particular, a technique called “streaming” is described that reduces the space requirements considerably. The methods have also a number of applications on set problems. E.g., the k intersecting pairs in a set of n axis-parallel hyper-rectangles in d dimensions can be reported in O (nlogd−1n + k) time using only O(n) space."}],"extern":"1","oa_version":"None","date_created":"2018-12-11T12:07:00Z","publist_id":"2010","title":"Batched dynamic solutions to decomposable searching problems","publication":"Journal of Algorithms","publisher":"Elsevier","citation":{"ama":"Edelsbrunner H, Overmars M. Batched dynamic solutions to decomposable searching problems. <i>Journal of Algorithms</i>. 1985;6(4):515-542. doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">10.1016/0196-6774(85)90030-6</a>","short":"H. Edelsbrunner, M. Overmars, Journal of Algorithms 6 (1985) 515–542.","ista":"Edelsbrunner H, Overmars M. 1985. Batched dynamic solutions to decomposable searching problems. Journal of Algorithms. 6(4), 515–542.","mla":"Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” <i>Journal of Algorithms</i>, vol. 6, no. 4, Elsevier, 1985, pp. 515–42, doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">10.1016/0196-6774(85)90030-6</a>.","chicago":"Edelsbrunner, Herbert, and Mark Overmars. “Batched Dynamic Solutions to Decomposable Searching Problems.” <i>Journal of Algorithms</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">https://doi.org/10.1016/0196-6774(85)90030-6</a>.","ieee":"H. Edelsbrunner and M. Overmars, “Batched dynamic solutions to decomposable searching problems,” <i>Journal of Algorithms</i>, vol. 6, no. 4. Elsevier, pp. 515–542, 1985.","apa":"Edelsbrunner, H., &#38; Overmars, M. (1985). Batched dynamic solutions to decomposable searching problems. <i>Journal of Algorithms</i>. Elsevier. <a href=\"https://doi.org/10.1016/0196-6774(85)90030-6\">https://doi.org/10.1016/0196-6774(85)90030-6</a>"},"publication_identifier":{"issn":["0196-6774"],"eissn":["1090-2678"]},"status":"public","acknowledgement":"Research reported in this paper was done while the second author visited the University of Graz. The first author was supported by the Austrian Fonds zur Förderung der Wissenschaftlichen Forschung. The second author was supported by the Netherlands Organization for the Advancement of Pure Research (ZWO). \r\n","article_type":"original","issue":"4","_id":"4112","year":"1985","page":"515 - 542","volume":6,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"oa_version":"None","date_created":"2018-12-11T12:07:01Z","publist_id":"2011","title":"On the number of line separations of a finite set in the plane","publication":"Journal of Combinatorial Theory Series A","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Let S denote a set of n points in the Euclidean plane. A subset S′ of S is termed a k-set of S if it contains k points and there exists a straight line which has no point of S on it and separates S′ from S−S′. We let fk(n) denote the maximum number of k-sets which can be realized by a set of n points. This paper studies the asymptotic behaviour of fk(n) as this function has applications to a number of problems in computational geometry. A lower and an upper bound on fk(n) is established. Both are nontrivial and improve bounds known before. In particular,  is shown by exhibiting special point-sets which realize that many k-sets. In addition,  is proved by the study of a combinatorial problem which is of interest in its own right."}],"extern":"1","_id":"4113","year":"1985","page":"15 - 29","volume":38,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">https://doi.org/10.1016/0097-3165(85)90017-2</a>.","ieee":"H. Edelsbrunner and E. Welzl, “On the number of line separations of a finite set in the plane,” <i>Journal of Combinatorial Theory Series A</i>, vol. 38, no. 1. Elsevier, pp. 15–29, 1985.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1985). On the number of line separations of a finite set in the plane. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">https://doi.org/10.1016/0097-3165(85)90017-2</a>","ama":"Edelsbrunner H, Welzl E. On the number of line separations of a finite set in the plane. <i>Journal of Combinatorial Theory Series A</i>. 1985;38(1):15-29. doi:<a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">10.1016/0097-3165(85)90017-2</a>","ista":"Edelsbrunner H, Welzl E. 1985. On the number of line separations of a finite set in the plane. Journal of Combinatorial Theory Series A. 38(1), 15–29.","short":"H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 38 (1985) 15–29.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Number of Line Separations of a Finite Set in the Plane.” <i>Journal of Combinatorial Theory Series A</i>, vol. 38, no. 1, Elsevier, 1985, pp. 15–29, doi:<a href=\"https://doi.org/10.1016/0097-3165(85)90017-2\">10.1016/0097-3165(85)90017-2</a>."},"publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"status":"public","article_type":"original","issue":"1","scopus_import":"1","quality_controlled":"1","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"date_published":"1985-01-01T00:00:00Z","doi":"10.1016/0097-3165(85)90017-2","date_updated":"2022-01-31T14:14:25Z","article_processing_charge":"No","intvolume":"        38","publication_status":"published","language":[{"iso":"eng"}],"month":"01","day":"01"},{"publist_id":"2006","date_created":"2018-12-11T12:07:01Z","oa_version":"None","publisher":"Springer","publication":"Journal of Classification","title":"Investigation of Proportional Link Linkage Clustering Methods","extern":"1","abstract":[{"lang":"eng","text":"Proportional link linkage (PLL) clustering methods are a parametric family of monotone invariant agglomerative hierarchical clustering methods. This family includes the single, minimedian, and complete linkage clustering methods as special cases; its members are used in psychological and ecological applications. Since the literature on clustering space distortion is oriented to quantitative input data, we adapt its basic concepts to input data with only ordinal significance and analyze the space distortion properties of PLL methods. To enable PLL methods to be used when the numbern of objects being clustered is large, we describe an efficient PLL algorithm that operates inO(n 2 logn) time andO(n 2) space"}],"year":"1985","_id":"4114","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":2,"page":"239 - 254","publication_identifier":{"eissn":["1432-1343"],"issn":["0176-4268"]},"citation":{"ama":"Day W, Edelsbrunner H. Investigation of Proportional Link Linkage Clustering Methods. <i>Journal of Classification</i>. 1985;2(2-3):239-254. doi:<a href=\"https://doi.org/10.1007/BF01908077\">10.1007/BF01908077</a>","ista":"Day W, Edelsbrunner H. 1985. Investigation of Proportional Link Linkage Clustering Methods. Journal of Classification. 2(2–3), 239–254.","short":"W. Day, H. Edelsbrunner, Journal of Classification 2 (1985) 239–254.","mla":"Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” <i>Journal of Classification</i>, vol. 2, no. 2–3, Springer, 1985, pp. 239–54, doi:<a href=\"https://doi.org/10.1007/BF01908077\">10.1007/BF01908077</a>.","chicago":"Day, William, and Herbert Edelsbrunner. “Investigation of Proportional Link Linkage Clustering Methods.” <i>Journal of Classification</i>. Springer, 1985. <a href=\"https://doi.org/10.1007/BF01908077\">https://doi.org/10.1007/BF01908077</a>.","ieee":"W. Day and H. Edelsbrunner, “Investigation of Proportional Link Linkage Clustering Methods,” <i>Journal of Classification</i>, vol. 2, no. 2–3. Springer, pp. 239–254, 1985.","apa":"Day, W., &#38; Edelsbrunner, H. (1985). Investigation of Proportional Link Linkage Clustering Methods. <i>Journal of Classification</i>. Springer. <a href=\"https://doi.org/10.1007/BF01908077\">https://doi.org/10.1007/BF01908077</a>"},"issue":"2-3","article_type":"original","acknowledgement":"This work was partially supported by the Natural Sciences and Engineering Research Council of Canada and by the Austrian Fonds zur Förderung der wissenschaftlichen Forschung.","status":"public","quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1007/BF01908077","date_updated":"2022-01-31T10:37:13Z","author":[{"first_name":"William","last_name":"Day","full_name":"Day, William"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"date_published":"1985-12-01T00:00:00Z","publication_status":"published","intvolume":"         2","month":"12","language":[{"iso":"eng"}],"day":"01"},{"date_published":"1985-06-01T00:00:00Z","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2022-01-31T10:44:41Z","doi":"10.1016/0196-6774(85)90039-2","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","intvolume":"         6","publication_status":"published","day":"01","language":[{"iso":"eng"}],"month":"06","title":"Computing the extreme distances between two convex polygons","publication":"Journal of Algorithms","publisher":"Academic Press","oa_version":"None","date_created":"2018-12-11T12:07:01Z","publist_id":"2007","abstract":[{"text":"A polygon in the plane is convex if it contains all line segments connecting any two of its points. Let P and Q denote two convex polygons. The computational complexity of finding the minimum and maximum distance possible between two points p in P and q in Q is studied. An algorithm is described that determines the minimum distance (together with points p and q that realize it) in O(logm + logn) time, where m and n denote the number of vertices of P and Q, respectively. This is optimal in the worst case. For computing the maximum distance, a lower bound Ω(m + n) is proved. This bound is also shown to be best possible by establishing an upper bound of O(m + n).","lang":"eng"}],"extern":"1","page":"213 - 224","volume":6,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4115","year":"1985","status":"public","article_type":"original","issue":"2","citation":{"apa":"Edelsbrunner, H. (1985). Computing the extreme distances between two convex polygons. <i>Journal of Algorithms</i>. Academic Press. <a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">https://doi.org/10.1016/0196-6774(85)90039-2</a>","ieee":"H. Edelsbrunner, “Computing the extreme distances between two convex polygons,” <i>Journal of Algorithms</i>, vol. 6, no. 2. Academic Press, pp. 213–224, 1985.","chicago":"Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” <i>Journal of Algorithms</i>. Academic Press, 1985. <a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">https://doi.org/10.1016/0196-6774(85)90039-2</a>.","ista":"Edelsbrunner H. 1985. Computing the extreme distances between two convex polygons. Journal of Algorithms. 6(2), 213–224.","short":"H. Edelsbrunner, Journal of Algorithms 6 (1985) 213–224.","mla":"Edelsbrunner, Herbert. “Computing the Extreme Distances between Two Convex Polygons.” <i>Journal of Algorithms</i>, vol. 6, no. 2, Academic Press, 1985, pp. 213–24, doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">10.1016/0196-6774(85)90039-2</a>.","ama":"Edelsbrunner H. Computing the extreme distances between two convex polygons. <i>Journal of Algorithms</i>. 1985;6(2):213-224. doi:<a href=\"https://doi.org/10.1016/0196-6774(85)90039-2\">10.1016/0196-6774(85)90039-2</a>"},"publication_identifier":{"eissn":["1090-2678"],"issn":["0196-6774"]}},{"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","doi":"10.1016/0304-3975(85)90005-2","date_updated":"2022-01-31T11:09:26Z","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_published":"1985-01-01T00:00:00Z","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/0304397585900052?via%3Dihub"}],"intvolume":"        35","month":"01","language":[{"iso":"eng"}],"day":"01","publist_id":"2008","date_created":"2018-12-11T12:07:02Z","oa_version":"Published Version","publisher":"Elsevier","publication":"Theoretical Computer Science","title":"Finding Transversals for Sets of Simple Geometric-Figures","extern":"1","abstract":[{"text":"A straight line that intersects all members of a set S of objects in the real plane is called a transversal of S. Geometric transforms are described that reduce transversal problems for various types of objects to convex hull problems for points. These reductions lead to efficient algorithms for finding transversals which are also described. Applications of the algorithms are found in computer graphics: “Reproduce the line displayed by a collection of pixels”, and in statistics: “Find the line that minimizes the maximum distance from a collection of (weighted) points in the plane”.","lang":"eng"}],"year":"1985","_id":"4116","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","volume":35,"page":"55 - 69","publication_identifier":{"issn":["0304-3975"],"eissn":["0304-3975"]},"citation":{"chicago":"Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” <i>Theoretical Computer Science</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">https://doi.org/10.1016/0304-3975(85)90005-2</a>.","ieee":"H. Edelsbrunner, “Finding Transversals for Sets of Simple Geometric-Figures,” <i>Theoretical Computer Science</i>, vol. 35, no. 1. Elsevier, pp. 55–69, 1985.","apa":"Edelsbrunner, H. (1985). Finding Transversals for Sets of Simple Geometric-Figures. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">https://doi.org/10.1016/0304-3975(85)90005-2</a>","ama":"Edelsbrunner H. Finding Transversals for Sets of Simple Geometric-Figures. <i>Theoretical Computer Science</i>. 1985;35(1):55-69. doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">10.1016/0304-3975(85)90005-2</a>","short":"H. Edelsbrunner, Theoretical Computer Science 35 (1985) 55–69.","ista":"Edelsbrunner H. 1985. Finding Transversals for Sets of Simple Geometric-Figures. Theoretical Computer Science. 35(1), 55–69.","mla":"Edelsbrunner, Herbert. “Finding Transversals for Sets of Simple Geometric-Figures.” <i>Theoretical Computer Science</i>, vol. 35, no. 1, Elsevier, 1985, pp. 55–69, doi:<a href=\"https://doi.org/10.1016/0304-3975(85)90005-2\">10.1016/0304-3975(85)90005-2</a>."},"issue":"1","article_type":"original","status":"public","oa":1,"acknowledgement":"The author gratefully acknowledges the criticism of an anonymous referee who discovered a serious flaw in an earlier version of this paper. "},{"quality_controlled":"1","date_published":"1985-03-01T00:00:00Z","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","doi":"10.1016/S0747-7171(85)80028-6","date_updated":"2022-01-31T09:20:18Z","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/S0747717185800286?via%3Dihub"}],"intvolume":"         1","publication_status":"published","month":"03","language":[{"iso":"eng"}],"day":"01","date_created":"2018-12-11T12:07:03Z","oa_version":"Published Version","publist_id":"2004","publication":"Journal of Symbolic Computation","title":"Optimal solutions for a class of point retrieval problems","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Let P be a set of n points in the Euclidean plane and let C be a convex figure. We study the problem of preprocessing P so that for any query point q, the points of P in C+q can be retrieved efficiently. If constant time sumces for deciding the inclusion of a point in C, we then demonstrate the existence of an optimal solution: the algorithm requires O(n) space and O(k + log n) time for a query with output size k. If C is a disk, the problem becomes the wellknown fixed-radius neighbour problem, to which we thus provide the first known optimal solution."}],"extern":"1","_id":"4120","year":"1985","volume":1,"page":"47 - 56","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","citation":{"ama":"Chazelle B, Edelsbrunner H. Optimal solutions for a class of point retrieval problems. <i>Journal of Symbolic Computation</i>. 1985;1(1):47-56. doi:<a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">10.1016/S0747-7171(85)80028-6</a>","ista":"Chazelle B, Edelsbrunner H. 1985. Optimal solutions for a class of point retrieval problems. Journal of Symbolic Computation. 1(1), 47–56.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” <i>Journal of Symbolic Computation</i>, vol. 1, no. 1, Elsevier, 1985, pp. 47–56, doi:<a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">10.1016/S0747-7171(85)80028-6</a>.","short":"B. Chazelle, H. Edelsbrunner, Journal of Symbolic Computation 1 (1985) 47–56.","ieee":"B. Chazelle and H. Edelsbrunner, “Optimal solutions for a class of point retrieval problems,” <i>Journal of Symbolic Computation</i>, vol. 1, no. 1. Elsevier, pp. 47–56, 1985.","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “Optimal Solutions for a Class of Point Retrieval Problems.” <i>Journal of Symbolic Computation</i>. Elsevier, 1985. <a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">https://doi.org/10.1016/S0747-7171(85)80028-6</a>.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1985). Optimal solutions for a class of point retrieval problems. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0747-7171(85)80028-6\">https://doi.org/10.1016/S0747-7171(85)80028-6</a>"},"publication_identifier":{"eissn":["1095-855X"],"issn":["0747-7171"]},"status":"public","oa":1,"acknowledgement":"The first author was supported i~1 part by NSF grants MCS 83-03925 and the Office of Naval Research and the Defense Advanced Research Projects Agency under contract N00014-g3-K-0146 and ARPA Order No. 4786.","issue":"1","article_type":"original"},{"citation":{"mla":"Curtis, C., et al. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, edited by Emil Skamene, vol. 3, Liss, 1985.","short":"C. Curtis, J. Curtis, N.H. Barton, in:, E. Skamene (Ed.), Genetic Control of Host Resistance to Infection and Malignancy, Liss, 1985.","ista":"Curtis C, Curtis J, Barton NH. 1985.Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Genetic Control of Host Resistance to Infection and Malignancy. Progress in leukocyte biology , vol. 3.","ama":"Curtis C, Curtis J, Barton NH. Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In: Skamene E, ed. <i>Genetic Control of Host Resistance to Infection and Malignancy</i>. Vol 3. Progress in leukocyte biology. Liss; 1985.","apa":"Curtis, C., Curtis, J., &#38; Barton, N. H. (1985). Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy. In E. Skamene (Ed.), <i>Genetic Control of Host Resistance to Infection and Malignancy</i> (Vol. 3). Liss.","ieee":"C. Curtis, J. Curtis, and N. H. Barton, “Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy,” in <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, vol. 3, E. Skamene, Ed. Liss, 1985.","chicago":"Curtis, C., J. Curtis, and Nicholas H Barton. “Methodology for Testing the Hypothesis of Single Locus Control of Host Resistance to Infection and Malignancy.” In <i>Genetic Control of Host Resistance to Infection and Malignancy</i>, edited by Emil Skamene, Vol. 3. Progress in Leukocyte Biology. Liss, 1985."},"publication_identifier":{"isbn":["9780845141021"]},"language":[{"iso":"eng"}],"month":"01","status":"public","day":"01","_id":"4241","intvolume":"         3","publication_status":"published","year":"1985","volume":3,"type":"book_chapter","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","extern":"1","quality_controlled":"1","series_title":"Progress in leukocyte biology","editor":[{"full_name":"Skamene, Emil","last_name":"Skamene","first_name":"Emil"}],"author":[{"full_name":"Curtis, C.","last_name":"Curtis","first_name":"C."},{"last_name":"Curtis","first_name":"J.","full_name":"Curtis, J."},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H"}],"date_published":"1985-01-01T00:00:00Z","date_updated":"2022-02-02T09:23:20Z","alternative_title":["Progress in leukocyte biology "],"article_processing_charge":"No","oa_version":"None","date_created":"2018-12-11T12:07:48Z","publist_id":"1872","title":"Methodology for testing the hypothesis of single locus control of host resistance to infection and malignancy","publication":"Genetic Control of Host Resistance to Infection and Malignancy","publisher":"Liss"},{"pmid":1,"status":"public","article_type":"original","external_id":{"pmid":["3990801"]},"day":"25","citation":{"short":"S. Jones, N.H. Barton, Nature 314 (1985) 668–668.","mla":"Jones, Steve, and Nicholas H. Barton. “Haldane’s Rule OK.” <i>Nature</i>, vol. 314, Nature Publishing Group, 1985, pp. 668–668, doi:<a href=\"https://doi.org/10.1038/314668a0\">10.1038/314668a0</a>.","ista":"Jones S, Barton NH. 1985. Haldane’s Rule OK. Nature. 314, 668–668.","ama":"Jones S, Barton NH. Haldane’s Rule OK. <i>Nature</i>. 1985;314:668-668. doi:<a href=\"https://doi.org/10.1038/314668a0\">10.1038/314668a0</a>","apa":"Jones, S., &#38; Barton, N. H. (1985). Haldane’s Rule OK. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/314668a0\">https://doi.org/10.1038/314668a0</a>","chicago":"Jones, Steve, and Nicholas H Barton. “Haldane’s Rule OK.” <i>Nature</i>. Nature Publishing Group, 1985. <a href=\"https://doi.org/10.1038/314668a0\">https://doi.org/10.1038/314668a0</a>.","ieee":"S. Jones and N. H. Barton, “Haldane’s Rule OK,” <i>Nature</i>, vol. 314. Nature Publishing Group, pp. 668–668, 1985."},"language":[{"iso":"eng"}],"month":"04","page":"668 - 668","volume":314,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4325","intvolume":"       314","publication_status":"published","year":"1985","date_published":"1985-04-25T00:00:00Z","author":[{"full_name":"Jones, Steve","first_name":"Steve","last_name":"Jones"},{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2022-01-28T12:42:09Z","doi":"10.1038/314668a0","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","extern":"1","title":"Haldane's Rule OK","publication":"Nature","publisher":"Nature Publishing Group","oa_version":"None","date_created":"2018-12-11T12:08:16Z","publist_id":"1716"},{"citation":{"chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Analysis of Hybrid Zones.” <i>Annual Review of Ecology and Systematics</i>. Annual Reviews, 1985. <a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">https://doi.org/10.1146/annurev.es.16.110185.000553</a>.","ieee":"N. H. Barton and G. Hewitt, “Analysis of hybrid zones,” <i>Annual Review of Ecology and Systematics</i>, vol. 16. Annual Reviews, pp. 113–148, 1985.","apa":"Barton, N. H., &#38; Hewitt, G. (1985). Analysis of hybrid zones. <i>Annual Review of Ecology and Systematics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">https://doi.org/10.1146/annurev.es.16.110185.000553</a>","ama":"Barton NH, Hewitt G. Analysis of hybrid zones. <i>Annual Review of Ecology and Systematics</i>. 1985;16:113-148. doi:<a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">10.1146/annurev.es.16.110185.000553</a>","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Analysis of Hybrid Zones.” <i>Annual Review of Ecology and Systematics</i>, vol. 16, Annual Reviews, 1985, pp. 113–48, doi:<a href=\"https://doi.org/10.1146/annurev.es.16.110185.000553\">10.1146/annurev.es.16.110185.000553</a>.","short":"N.H. Barton, G. Hewitt, Annual Review of Ecology and Systematics 16 (1985) 113–148.","ista":"Barton NH, Hewitt G. 1985. Analysis of hybrid zones. Annual Review of Ecology and Systematics. 16, 113–148."},"month":"11","publication_identifier":{"eissn":["1545-2069"],"issn":["0066-4162"]},"language":[{"iso":"eng"}],"acknowledgement":"We thank R. Butlin, D. Currie, R. A. Nichols , and S. Rouhani for their thoughtful comments on the manuscript, and their help in preparing the Figures and Tables; all those (too numerous to name) who gave us details of their unpublished work; and T. Tsang and S. Ward for their patient typing. This work was supported by grants from the NERC and SERC to G. M. Hewitt, and from the SERC and the Nuffield Foundation to N. H. Barton.","status":"public","day":"01","article_type":"original","_id":"4326","intvolume":"        16","year":"1985","publication_status":"published","volume":16,"page":"113 - 148","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","extern":"1","quality_controlled":"1","date_published":"1985-11-01T00:00:00Z","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"}],"article_processing_charge":"No","doi":"10.1146/annurev.es.16.110185.000553","date_updated":"2022-01-28T12:32:23Z","date_created":"2018-12-11T12:08:16Z","oa_version":"None","publist_id":"1714","publication":"Annual Review of Ecology and Systematics","title":"Analysis of hybrid zones","publisher":"Annual Reviews"},{"article_processing_charge":"No","date_updated":"2022-01-28T12:10:55Z","author":[{"full_name":"Dobkin, David","first_name":"David","last_name":"Dobkin"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"date_published":"1984-01-01T00:00:00Z","series_title":"WG","quality_controlled":"1","extern":"1","publisher":"Teubner","publication":"9th International Workshop on Graph Theoretic Concepts in Computer Science","title":"Ham-sandwich theorems applied to intersection problems","publist_id":"2872","date_created":"2018-12-11T12:03:43Z","conference":{"location":"Haus Ohrbeck, Germany","name":"WG: International Workshop on Graph Theoretic Concepts in Computer Science"},"oa_version":"None","day":"01","status":"public","month":"01","publication_identifier":{"isbn":["3-853-20311-6"]},"language":[{"iso":"eng"}],"citation":{"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.","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.","short":"D. Dobkin, H. Edelsbrunner, in:, 9th International Workshop on Graph Theoretic Concepts in Computer Science, Teubner, 1984, pp. 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.","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.","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."},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","page":"88 - 99","year":"1984","publication_status":"published","main_file_link":[{"url":"http://pub.ist.ac.at/~edels/Papers/1984-P-06-HamSandwichTheorems.pdf"}],"_id":"3513"},{"oa_version":"None","date_created":"2018-12-11T12:07:02Z","publist_id":"2001","title":"Computing the connected components of simple rectilinear geometrical objects in D-Space","publication":"Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications","publisher":"EDP Sciences","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."}],"extern":"1","quality_controlled":"1","date_published":"1984-01-01T00:00:00Z","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"full_name":"Van Leeuwen, Jan","last_name":"Van Leeuwen","first_name":"Jan"},{"last_name":"Ottmann","first_name":"Thomas","full_name":"Ottmann, Thomas"},{"first_name":"Derick","last_name":"Wood","full_name":"Wood, Derick"}],"doi":"10.1051/ita/1984180201711","date_updated":"2022-01-27T15:22:30Z","article_processing_charge":"No","intvolume":"        18","_id":"4117","publication_status":"published","year":"1984","page":"171 - 183","volume":18,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","citation":{"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.","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>","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>","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.","short":"H. Edelsbrunner, J. Van Leeuwen, T. Ottmann, D. Wood, Rairo-Informatique Theorique Et Applications-Theoretical Informatics and Applications 18 (1984) 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>."},"publication_identifier":{"eissn":["1290-385X"],"issn":["0397-9326"]},"language":[{"iso":"eng"}],"month":"01","status":"public","day":"01","article_type":"original","issue":"2"},{"extern":"1","abstract":[{"lang":"eng","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."}],"publisher":"Elsevier","title":"Stationing guards in rectilinear art galleries","publication":"Computer Vision, Graphics, and Image Processing","publist_id":"2002","oa_version":"None","date_created":"2018-12-11T12:07:02Z","article_type":"original","issue":"2","status":"public","publication_identifier":{"eissn":["0734-189X"],"issn":["1557-895X"]},"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>","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>","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>.","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."},"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"167 - 176","volume":27,"year":"1984","_id":"4118","date_updated":"2022-01-28T08:03:51Z","doi":"10.1016/S0734-189X(84)80041-9","article_processing_charge":"No","date_published":"1984-08-01T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Joseph","last_name":"O'Rourke","full_name":"O'Rourke, Joseph"},{"last_name":"Welzl","first_name":"Emo","full_name":"Welzl, Emo"}],"quality_controlled":"1","scopus_import":"1","day":"01","language":[{"iso":"eng"}],"month":"08","publication_status":"published","intvolume":"        27"},{"intvolume":"       176","publication_status":"published","day":"01","language":[{"iso":"eng"}],"month":"01","conference":{"end_date":"1984-09-07","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"1984-09-03","location":"Praha, Czechoslovakia"},"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"date_published":"1984-01-01T00:00:00Z","doi":"10.1007/BFb0030307","date_updated":"2022-01-28T08:52:23Z","alternative_title":["LNCS"],"article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","page":"265 - 272","volume":176,"type":"conference","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4119","year":"1984","status":"public","citation":{"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>","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>.","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.","short":"H. Edelsbrunner, E. Welzl, in:, 11th International Symposium on Mathematical Foundations of Computer Science, Springer, 1984, pp. 265–272.","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.","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>"},"publication_identifier":{"isbn":["3-540-13372-0"]},"title":"Monotone edge sequences in line arrangements and applications","publication":"11th International Symposium on Mathematical Foundations of Computer Science","publisher":"Springer","oa_version":"None","date_created":"2018-12-11T12:07:03Z","publist_id":"2003","extern":"1","series_title":"MFCS"},{"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."}],"extern":"1","quality_controlled":"1","date_published":"1984-01-01T00:00:00Z","author":[{"full_name":"Day, William","first_name":"William","last_name":"Day"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"}],"doi":"10.1007/BF01890115","date_updated":"2022-01-27T14:16:27Z","article_processing_charge":"No","oa_version":"None","date_created":"2018-12-11T12:07:04Z","publist_id":"1998","title":"Efficient algorithms for agglomerative hierarchical clustering methods","publication":"Journal of Classification","publisher":"Springer","citation":{"short":"W. Day, H. Edelsbrunner, Journal of Classification 1 (1984) 7–24.","ista":"Day W, Edelsbrunner H. 1984. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification. 1, 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>","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>","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."},"publication_identifier":{"eissn":["1432-1343"],"issn":["0176-4268"]},"language":[{"iso":"eng"}],"month":"01","status":"public","article_type":"original","day":"01","_id":"4121","intvolume":"         1","main_file_link":[{"url":"https://link.springer.com/article/10.1007%2FBF01890115"}],"publication_status":"published","year":"1984","page":"7 - 24","volume":1,"type":"journal_article","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"year":"1984","_id":"4122","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"conference","volume":166,"page":"1 - 13","publication_identifier":{"isbn":["3-540-12920-0"]},"citation":{"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.","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>","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>."},"status":"public","publist_id":"1999","date_created":"2018-12-11T12:07:04Z","oa_version":"None","publisher":"Springer","publication":"1st Symposium of Theoretical Aspects of Computer Science","title":"Key-problems and key-methods in computational geometry","series_title":"STACS","extern":"1","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"}],"publication_status":"published","intvolume":"       166","month":"01","language":[{"iso":"eng"}],"day":"01","conference":{"end_date":"1984-04-13","name":"STACS: Theoretical Aspects of Computer Science","start_date":"1984-04-11","location":"Paris, France"},"quality_controlled":"1","scopus_import":"1","article_processing_charge":"No","alternative_title":["LNCS"],"doi":"10.1007/3-540-12920-0_1","date_updated":"2022-01-27T14:48:15Z","date_published":"1984-01-01T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}]},{"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Overmars, Mark","first_name":"Mark","last_name":"Overmars"},{"full_name":"Seidel, Raimund","first_name":"Raimund","last_name":"Seidel"}],"date_published":"1984-10-01T00:00:00Z","article_processing_charge":"No","doi":"10.1016/0734-189X(84)90142-7","date_updated":"2022-01-27T15:10:04Z","quality_controlled":"1","intvolume":"        28","publication_status":"published","day":"01","month":"10","language":[{"iso":"eng"}],"publication":"Computer Vision, Graphics, and Image Processing","title":"Some methods of computational geometry applied to computer graphics","publisher":"Elsevier","date_created":"2018-12-11T12:07:04Z","oa_version":"None","publist_id":"2000","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"}],"extern":"1","volume":28,"page":"92 - 108","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","type":"journal_article","_id":"4123","year":"1984","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","status":"public","issue":"1","article_type":"original","citation":{"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>","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.","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>.","short":"H. Edelsbrunner, M. Overmars, R. Seidel, Computer Vision, Graphics, and Image Processing 28 (1984) 92–108.","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.","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>.","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_identifier":{"eissn":["1557-895X"],"issn":["0734-189X"]}}]