[{"day":"01","language":[{"iso":"eng"}],"issue":"11","oa_version":"None","date_updated":"2022-02-04T10:32:27Z","doi":"10.1109/TC.1987.5009474","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://ieeexplore.ieee.org/document/5009474"}],"month":"11","status":"public","date_published":"1987-11-01T00:00:00Z","publication_status":"published","abstract":[{"text":"he kth-order Voronoi diagram of a finite set of sites in the Euclidean plane E2 subdivides E2 into maximal regions such that all points within a given region have the same k nearest sites. Two versions of an algorithm are developed for constructing the kth-order Voronoi diagram of a set of n sites in O(n2 log n + k(n - k) log2 n) time, O(k(n - k)) storage, and in O(n2 + k(n - k) log2 n) time, O(n2) storage, respectively.","lang":"eng"}],"extern":"1","type":"journal_article","publisher":"IEEE","intvolume":"        36","author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"}],"_id":"4095","citation":{"chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Improved Algorithm for Constructing Kth-Order Voronoi Diagrams.” <i>IEEE Transactions on Computers</i>. IEEE, 1987. <a href=\"https://doi.org/10.1109/TC.1987.5009474\">https://doi.org/10.1109/TC.1987.5009474</a>.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1987). An improved algorithm for constructing kth-order Voronoi diagrams. <i>IEEE Transactions on Computers</i>. IEEE. <a href=\"https://doi.org/10.1109/TC.1987.5009474\">https://doi.org/10.1109/TC.1987.5009474</a>","short":"B. Chazelle, H. Edelsbrunner, IEEE Transactions on Computers 36 (1987) 1349–1354.","ama":"Chazelle B, Edelsbrunner H. An improved algorithm for constructing kth-order Voronoi diagrams. <i>IEEE Transactions on Computers</i>. 1987;36(11):1349-1354. doi:<a href=\"https://doi.org/10.1109/TC.1987.5009474\">10.1109/TC.1987.5009474</a>","ista":"Chazelle B, Edelsbrunner H. 1987. An improved algorithm for constructing kth-order Voronoi diagrams. IEEE Transactions on Computers. 36(11), 1349–1354.","ieee":"B. Chazelle and H. Edelsbrunner, “An improved algorithm for constructing kth-order Voronoi diagrams,” <i>IEEE Transactions on Computers</i>, vol. 36, no. 11. IEEE, pp. 1349–1354, 1987.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “An Improved Algorithm for Constructing Kth-Order Voronoi Diagrams.” <i>IEEE Transactions on Computers</i>, vol. 36, no. 11, IEEE, 1987, pp. 1349–54, doi:<a href=\"https://doi.org/10.1109/TC.1987.5009474\">10.1109/TC.1987.5009474</a>."},"scopus_import":"1","quality_controlled":"1","publication_identifier":{"issn":["0018-9340"],"eissn":["1557-9956"]},"date_created":"2018-12-11T12:06:54Z","acknowledgement":"We would like to thank two anonymous referees for their constructive criticism. ","article_processing_charge":"No","year":"1987","publication":"IEEE Transactions on Computers","title":"An improved algorithm for constructing kth-order Voronoi diagrams","article_type":"original","volume":36,"page":"1349 - 1354","publist_id":"2026"},{"day":"01","date_updated":"2022-02-03T11:07:26Z","oa_version":"None","issue":"1","language":[{"iso":"eng"}],"month":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1007/BF02187875","extern":"1","abstract":[{"text":"This paper investigates the existence of linear space data structures for range searching. We examine thehomothetic range search problem, where a setS ofn points in the plane is to be preprocessed so that for any triangleT with sides parallel to three fixed directions the points ofS that lie inT can be computed efficiently. We also look atdomination searching in three dimensions. In this problem,S is a set ofn points inE 3 and the question is to retrieve all points ofS that are dominated by some query point. We describe linear space data structures for both problems. The query time is optimal in the first case and nearly optimal in the second.\r\n","lang":"eng"}],"publication_status":"published","status":"public","date_published":"1987-01-01T00:00:00Z","publisher":"Springer","intvolume":"         2","type":"journal_article","citation":{"short":"B. Chazelle, H. Edelsbrunner, Discrete &#38; Computational Geometry 2 (1987) 113–126.","apa":"Chazelle, B., &#38; Edelsbrunner, H. (1987). Linear space data structures for two types of range search. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187875\">https://doi.org/10.1007/BF02187875</a>","chicago":"Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1987. <a href=\"https://doi.org/10.1007/BF02187875\">https://doi.org/10.1007/BF02187875</a>.","ista":"Chazelle B, Edelsbrunner H. 1987. Linear space data structures for two types of range search. Discrete &#38; Computational Geometry. 2(1), 113–126.","ieee":"B. Chazelle and H. Edelsbrunner, “Linear space data structures for two types of range search,” <i>Discrete &#38; Computational Geometry</i>, vol. 2, no. 1. Springer, pp. 113–126, 1987.","mla":"Chazelle, Bernard, and Herbert Edelsbrunner. “Linear Space Data Structures for Two Types of Range Search.” <i>Discrete &#38; Computational Geometry</i>, vol. 2, no. 1, Springer, 1987, pp. 113–26, doi:<a href=\"https://doi.org/10.1007/BF02187875\">10.1007/BF02187875</a>.","ama":"Chazelle B, Edelsbrunner H. Linear space data structures for two types of range search. <i>Discrete &#38; Computational Geometry</i>. 1987;2(1):113-126. doi:<a href=\"https://doi.org/10.1007/BF02187875\">10.1007/BF02187875</a>"},"scopus_import":"1","quality_controlled":"1","_id":"4100","author":[{"full_name":"Chazelle, Bernard","last_name":"Chazelle","first_name":"Bernard"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"}],"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"article_processing_charge":"No","acknowledgement":"This research was conducted while the first author was with Brown University and the second author was with the Technical University of Graz, Austria. The first author was supported in part by NSF Grant MCS 83-03925.","date_created":"2018-12-11T12:06:56Z","publist_id":"2022","page":"113 - 126","publication":"Discrete & Computational Geometry","year":"1987","volume":2,"title":"Linear space data structures for two types of range search","article_type":"original"},{"extern":"1","abstract":[{"lang":"eng","text":"In a number of recent papers, techniques from computational geometry (the field of algorithm design that deals with objects in multi-dimensional space) have been applied to some problems in the area of computer graphics. In this way, efficient solutions were obtained for the windowing problem that asks for those line segments in a planar set that lie in given window (range) and the moving problem that asks for the first line segment that comes into the window when moving the window in some direction. In this paper we show that also the zooming problem, which asks for the first line segment that comes into the window when we enlarge it, can be solved efficiently. This is done by repeatedly performing range queries with ranges of varying sizes. The obtained structure is dynamic and yields a query time of O(log2n) and an insertion and deletion time of O(log2n), where n is the number of line segments in the set. The amount of storage required is O(n log n). It is also shown that the technique of repeated range search can be used to solve several other problems efficiently."}],"publication_status":"published","date_published":"1987-04-06T00:00:00Z","status":"public","month":"04","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0020019087901207?via%3Dihub"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1016/0020-0190(87)90120-7","date_updated":"2022-02-03T13:29:17Z","oa_version":"None","issue":"6","language":[{"iso":"eng"}],"day":"06","publist_id":"2023","page":"413 - 417","volume":24,"article_type":"original","title":"Zooming by repeated range detection","publication":"Information Processing Letters","year":"1987","article_processing_charge":"No","date_created":"2018-12-11T12:06:57Z","publication_identifier":{"issn":["0020-0190"],"eissn":["1872-6119"]},"quality_controlled":"1","scopus_import":"1","citation":{"ama":"Edelsbrunner H, Overmars M. Zooming by repeated range detection. <i>Information Processing Letters</i>. 1987;24(6):413-417. doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">10.1016/0020-0190(87)90120-7</a>","ieee":"H. Edelsbrunner and M. Overmars, “Zooming by repeated range detection,” <i>Information Processing Letters</i>, vol. 24, no. 6. Elsevier, pp. 413–417, 1987.","mla":"Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.” <i>Information Processing Letters</i>, vol. 24, no. 6, Elsevier, 1987, pp. 413–17, doi:<a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">10.1016/0020-0190(87)90120-7</a>.","ista":"Edelsbrunner H, Overmars M. 1987. Zooming by repeated range detection. Information Processing Letters. 24(6), 413–417.","chicago":"Edelsbrunner, Herbert, and Mark Overmars. “Zooming by Repeated Range Detection.” <i>Information Processing Letters</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">https://doi.org/10.1016/0020-0190(87)90120-7</a>.","short":"H. Edelsbrunner, M. Overmars, Information Processing Letters 24 (1987) 413–417.","apa":"Edelsbrunner, H., &#38; Overmars, M. (1987). Zooming by repeated range detection. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(87)90120-7\">https://doi.org/10.1016/0020-0190(87)90120-7</a>"},"_id":"4101","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Overmars, Mark","last_name":"Overmars","first_name":"Mark"}],"intvolume":"        24","publisher":"Elsevier","type":"journal_article"},{"publisher":"Academic Press","intvolume":"         8","type":"journal_article","citation":{"apa":"Dobkin, D., &#38; Edelsbrunner, H. (1987). Space searching for intersecting objects. <i>Journal of Algorithms</i>. Academic Press. <a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">https://doi.org/10.1016/0196-6774(87)90015-0</a>","short":"D. Dobkin, H. Edelsbrunner, Journal of Algorithms 8 (1987) 348–361.","chicago":"Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” <i>Journal of Algorithms</i>. Academic Press, 1987. <a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">https://doi.org/10.1016/0196-6774(87)90015-0</a>.","ista":"Dobkin D, Edelsbrunner H. 1987. Space searching for intersecting objects. Journal of Algorithms. 8(3), 348–361.","ieee":"D. Dobkin and H. Edelsbrunner, “Space searching for intersecting objects,” <i>Journal of Algorithms</i>, vol. 8, no. 3. Academic Press, pp. 348–361, 1987.","mla":"Dobkin, David, and Herbert Edelsbrunner. “Space Searching for Intersecting Objects.” <i>Journal of Algorithms</i>, vol. 8, no. 3, Academic Press, 1987, pp. 348–61, doi:<a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">10.1016/0196-6774(87)90015-0</a>.","ama":"Dobkin D, Edelsbrunner H. Space searching for intersecting objects. <i>Journal of Algorithms</i>. 1987;8(3):348-361. doi:<a href=\"https://doi.org/10.1016/0196-6774(87)90015-0\">10.1016/0196-6774(87)90015-0</a>"},"scopus_import":"1","quality_controlled":"1","_id":"4102","author":[{"full_name":"Dobkin, David","first_name":"David","last_name":"Dobkin"},{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"eissn":["1090-2678"],"issn":["0196-6774"]},"article_processing_charge":"No","date_created":"2018-12-11T12:06:57Z","publist_id":"2024","page":"348 - 361","publication":"Journal of Algorithms","year":"1987","volume":8,"article_type":"original","title":"Space searching for intersecting objects","day":"01","oa_version":"None","date_updated":"2022-02-03T13:47:53Z","issue":"3","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0196677487900150?via%3Dihub"}],"month":"09","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1016/0196-6774(87)90015-0","extern":"1","abstract":[{"text":"Determining or counting geometric objects that intersect another geometric query object is at the core of algorithmic problems in a number of applied areas of computer science. This article presents a family of space-efficient data structures that realize sublinear query time for points, line segments, lines and polygons in the plane, and points, line segments, planes, and polyhedra in three dimensions.","lang":"eng"}],"publication_status":"published","status":"public","date_published":"1987-09-01T00:00:00Z"},{"publication":"Heredity","year":"1987","volume":58,"title":"Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris","article_type":"original","publist_id":"1733","page":"221 - 228","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"article_processing_charge":"No","date_created":"2018-12-11T12:08:14Z","acknowledgement":"s We would like to thank Manse East for technical assistance and M. et Mme Aviotti for their hospitality in France. We are grateful to Dr Michael Rennet, Dr Donald Fox, Professor Hubert Rees, and an anonymous referee for their helpful comments on earlier manuscripts. This work was supported by an S.E.R.C. grant to G.M.H., and by an S.E.R.C. postdoctoral fellowship to N.H.B. MW. worked at UEA under an Outside Studies Program.\r\n","_id":"4319","author":[{"first_name":"Michael","last_name":"Westerman","full_name":"Westerman, Michael"},{"full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H"},{"last_name":"Hewitt","first_name":"Godfrey","full_name":"Hewitt, Godfrey"}],"citation":{"ieee":"M. Westerman, N. H. Barton, and G. Hewitt, “Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris,” <i>Heredity</i>, vol. 58. Nature Publishing Group, pp. 221–228, 1987.","mla":"Westerman, Michael, et al. “Differences in DNA Content between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” <i>Heredity</i>, vol. 58, Nature Publishing Group, 1987, pp. 221–28, doi:<a href=\"https://doi.org/10.1038/hdy.1987.36\">10.1038/hdy.1987.36</a>.","ista":"Westerman M, Barton NH, Hewitt G. 1987. Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. Heredity. 58, 221–228.","ama":"Westerman M, Barton NH, Hewitt G. Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. <i>Heredity</i>. 1987;58:221-228. doi:<a href=\"https://doi.org/10.1038/hdy.1987.36\">10.1038/hdy.1987.36</a>","apa":"Westerman, M., Barton, N. H., &#38; Hewitt, G. (1987). Differences in DNA content between two chromosomal races of the grasshopper Podisma pedestris. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1987.36\">https://doi.org/10.1038/hdy.1987.36</a>","short":"M. Westerman, N.H. Barton, G. Hewitt, Heredity 58 (1987) 221–228.","chicago":"Westerman, Michael, Nicholas H Barton, and Godfrey Hewitt. “Differences in DNA Content between Two Chromosomal Races of the Grasshopper Podisma Pedestris.” <i>Heredity</i>. Nature Publishing Group, 1987. <a href=\"https://doi.org/10.1038/hdy.1987.36\">https://doi.org/10.1038/hdy.1987.36</a>."},"scopus_import":"1","quality_controlled":"1","type":"journal_article","publisher":"Nature Publishing Group","intvolume":"        58","status":"public","date_published":"1987-01-01T00:00:00Z","extern":"1","abstract":[{"lang":"eng","text":"The grasshopper Podisma pedestris contains two chromosomal races, which differ by a Robertsonian fusion between the sex chromosome and an autosome, and which meet in a narrow hybrid zone in the Alpes Maritimes. DNA content variation across this hybrid zone was investigated by optical densitometry of Feulgen stained spermatids. Spermatids from males with the unfused sex chromosome stain more strongly than those from males with the fused chromosome. The difference between the karyotypes is greater in the centre of the hybrid zone, suggesting that it is not a pleiotropic effect of the fusion itself, but is due instead to differences at closely linked loci."}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1038/hdy.1987.36","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198736"}],"month":"01","oa":1,"language":[{"iso":"eng"}],"date_updated":"2022-02-03T10:48:40Z","oa_version":"Published Version","day":"01"},{"date_updated":"2022-02-03T10:33:03Z","oa_version":"None","issue":"1-2","language":[{"iso":"eng"}],"day":"01","extern":"1","publication_status":"published","abstract":[{"text":"Bosonic field theories may be formulated in terms of stochastic differential equations. The characteristic long term behaviour of these systems is a decay into the global minimum of their Hamiltonian. If local minima exist, the rate of this decay is determined by instanton effects. We calculate the decay rate and perform computer simulations on a 1 + 1 dimensional model to test the instanton approximation. We find the instanton approximations to be in very good agreement with the simulation results.","lang":"eng"}],"status":"public","date_published":"1987-01-01T00:00:00Z","month":"01","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1016/0378-4371(87)90064-1","citation":{"ama":"Rouhani S, Barton NH. Instantons in stochastic quantization. <i>Physica A: Statistical Mechanics and its Applications</i>. 1987;143(1-2):220-226. doi:<a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">10.1016/0378-4371(87)90064-1</a>","ista":"Rouhani S, Barton NH. 1987. Instantons in stochastic quantization. Physica A: Statistical Mechanics and its Applications. 143(1–2), 220–226.","ieee":"S. Rouhani and N. H. Barton, “Instantons in stochastic quantization,” <i>Physica A: Statistical Mechanics and its Applications</i>, vol. 143, no. 1–2. Elsevier, pp. 220–226, 1987.","mla":"Rouhani, Shahin, and Nicholas H. Barton. “Instantons in Stochastic Quantization.” <i>Physica A: Statistical Mechanics and Its Applications</i>, vol. 143, no. 1–2, Elsevier, 1987, pp. 220–26, doi:<a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">10.1016/0378-4371(87)90064-1</a>.","chicago":"Rouhani, Shahin, and Nicholas H Barton. “Instantons in Stochastic Quantization.” <i>Physica A: Statistical Mechanics and Its Applications</i>. Elsevier, 1987. <a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">https://doi.org/10.1016/0378-4371(87)90064-1</a>.","apa":"Rouhani, S., &#38; Barton, N. H. (1987). Instantons in stochastic quantization. <i>Physica A: Statistical Mechanics and Its Applications</i>. Elsevier. <a href=\"https://doi.org/10.1016/0378-4371(87)90064-1\">https://doi.org/10.1016/0378-4371(87)90064-1</a>","short":"S. Rouhani, N.H. Barton, Physica A: Statistical Mechanics and Its Applications 143 (1987) 220–226."},"scopus_import":"1","quality_controlled":"1","_id":"4320","author":[{"first_name":"Shahin","last_name":"Rouhani","full_name":"Rouhani, Shahin"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"publisher":"Elsevier","intvolume":"       143","type":"journal_article","publist_id":"1730","page":"220 - 226","publication":"Physica A: Statistical Mechanics and its Applications","year":"1987","volume":143,"title":"Instantons in stochastic quantization","article_type":"original","publication_identifier":{"issn":["0378-4371"],"eissn":["1873-2119"]},"article_processing_charge":"No","date_created":"2018-12-11T12:08:14Z"},{"type":"journal_article","publisher":"Cambridge University Press","intvolume":"        50","_id":"4322","author":[{"last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"citation":{"ama":"Barton NH. The probability of establishment of an advantageous mutation in a subdivided population. <i>Genetical Research</i>. 1987;50(1):35-40. doi:<a href=\"https://doi.org/10.1017/S0016672300023314\">10.1017/S0016672300023314</a>","mla":"Barton, Nicholas H. “The Probability of Establishment of an Advantageous Mutation in a Subdivided Population.” <i>Genetical Research</i>, vol. 50, no. 1, Cambridge University Press, 1987, pp. 35–40, doi:<a href=\"https://doi.org/10.1017/S0016672300023314\">10.1017/S0016672300023314</a>.","ieee":"N. H. Barton, “The probability of establishment of an advantageous mutation in a subdivided population,” <i>Genetical Research</i>, vol. 50, no. 1. Cambridge University Press, pp. 35–40, 1987.","ista":"Barton NH. 1987. The probability of establishment of an advantageous mutation in a subdivided population. Genetical Research. 50(1), 35–40.","chicago":"Barton, Nicholas H. “The Probability of Establishment of an Advantageous Mutation in a Subdivided Population.” <i>Genetical Research</i>. Cambridge University Press, 1987. <a href=\"https://doi.org/10.1017/S0016672300023314\">https://doi.org/10.1017/S0016672300023314</a>.","short":"N.H. Barton, Genetical Research 50 (1987) 35–40.","apa":"Barton, N. H. (1987). The probability of establishment of an advantageous mutation in a subdivided population. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300023314\">https://doi.org/10.1017/S0016672300023314</a>"},"quality_controlled":"1","scopus_import":"1","publication_identifier":{"eissn":["1469-5073"],"issn":["0016-6723"]},"article_processing_charge":"No","acknowledgement":"This work was supported by a grant from the Science and Engineering Research Council (GR/D/91529). Shahin\r\nRouhani supplied the proof that no positive solution to (6) exists when all eigenvalues are negative (Appendix);\r\nM. Slatkin, M. Turelli, T. Nagylaki and he also gave helpful comments on the manuscript.","date_created":"2018-12-11T12:08:15Z","publication":"Genetical Research","year":"1987","volume":50,"external_id":{"pmid":["3653687 "]},"article_type":"original","title":"The probability of establishment of an advantageous mutation in a subdivided population","publist_id":"1725","page":"35 - 40","day":"01","language":[{"iso":"eng"}],"date_updated":"2022-02-03T10:16:16Z","oa_version":"None","issue":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","pmid":1,"doi":"10.1017/S0016672300023314","month":"01","status":"public","date_published":"1987-01-01T00:00:00Z","extern":"1","abstract":[{"text":"A method is developed for calculating the probability of establishment of an allele which is favoured in some places, but not others, in a large subdivided population. This method is quite general, and could be used to calculate the chance that any system which is linear near an absorbing boundary will move away from that boundary. The results are applied to a population distributed along one dimension. Only mutants which arise within a distance  σ/ √2s of the region in which they are favoured stand an appreciable chance of establishment. The net chance of establishment of mutations distributed randomly across the habitat will be decreased by gene flow if selection against them is sufficiently strong. However, if the mutations are only weakly deleterious outside some limited region, gene flow may increase the net chance of establishment.","lang":"eng"}],"publication_status":"published"},{"day":"01","date_updated":"2022-02-03T09:46:42Z","oa_version":"None","issue":"1","language":[{"iso":"eng"}],"month":"07","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1007/BF00580727","pmid":1,"extern":"1","abstract":[{"lang":"eng","text":"The effects of the major neurotoxic fraction isolated from scorpion venom of Tityus serrulatus, TiTx gamma, on peripheral nerve membrane of Xenopus laevis were studied under current- and voltage-clamp conditions. 700 nmol/l TiTx gamma depolarized the membrane and induced spontaneous activity (150 s-1, maximum value), which ceased within a few minutes. It reduced the amplitude of the action potentials from 109 mV to 52 mV and increased their duration from 1.25 ms to 4.5 ms. 440 nmol/l TiTx gamma induced inward Na current flow at resting potential. The descending branch of the Na current-voltage curve was flattened and shifted approximately 10 mV to more negative potentials. Maximum Na permeability was reduced to about 20%. Both development of and recovery from inactivation of Na permeability were slowed. The steepness of the steady-state inactivation curve was decreased, but the mid-potential changed only insignificantly. No prepulse was necessary to elicit either a shift of activation or an inward current at resting potential. Expressing the toxin effect either in terms of the decrease of Na peak current or of the slowing of inactivation, half-maximum effects were found with 0.3 +/- 0.1 and 3.7 +/- 0.7 mumol/l TiTx gamma, respectively."}],"publication_status":"published","date_published":"1986-07-01T00:00:00Z","status":"public","intvolume":"       407","publisher":"Springer","type":"journal_article","quality_controlled":"1","citation":{"ama":"Jonas PM, Vogel W, Arantes E, Giglio J. Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane. <i>Pflugers Archiv : European Journal of Physiology</i>. 1986;407(1):92-99. doi:<a href=\"https://doi.org/10.1007/BF00580727\">10.1007/BF00580727</a>","mla":"Jonas, Peter M., et al. “Toxin γ of the Scorpion Tityus Serrulatus Modifies Both Activation and Inactivation of Sodium Permeability of Nerve Membrane.” <i>Pflugers Archiv : European Journal of Physiology</i>, vol. 407, no. 1, Springer, 1986, pp. 92–99, doi:<a href=\"https://doi.org/10.1007/BF00580727\">10.1007/BF00580727</a>.","ista":"Jonas PM, Vogel W, Arantes E, Giglio J. 1986. Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane. Pflugers Archiv : European Journal of Physiology. 407(1), 92–99.","ieee":"P. M. Jonas, W. Vogel, E. Arantes, and J. Giglio, “Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane,” <i>Pflugers Archiv : European Journal of Physiology</i>, vol. 407, no. 1. Springer, pp. 92–99, 1986.","chicago":"Jonas, Peter M, Werner Vogel, Eliane Arantes, and Jose Giglio. “Toxin γ of the Scorpion Tityus Serrulatus Modifies Both Activation and Inactivation of Sodium Permeability of Nerve Membrane.” <i>Pflugers Archiv : European Journal of Physiology</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF00580727\">https://doi.org/10.1007/BF00580727</a>.","apa":"Jonas, P. M., Vogel, W., Arantes, E., &#38; Giglio, J. (1986). Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane. <i>Pflugers Archiv : European Journal of Physiology</i>. Springer. <a href=\"https://doi.org/10.1007/BF00580727\">https://doi.org/10.1007/BF00580727</a>","short":"P.M. Jonas, W. Vogel, E. Arantes, J. Giglio, Pflugers Archiv : European Journal of Physiology 407 (1986) 92–99."},"_id":"3464","author":[{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M"},{"first_name":"Werner","last_name":"Vogel","full_name":"Vogel, Werner"},{"full_name":"Arantes, Eliane","first_name":"Eliane","last_name":"Arantes"},{"full_name":"Giglio, Jose","last_name":"Giglio","first_name":"Jose"}],"article_processing_charge":"No","date_created":"2018-12-11T12:03:28Z","publication_identifier":{"issn":["0031-6768"],"eissn":["1432-2013"]},"publist_id":"2923","page":"92 - 99","volume":407,"title":"Toxin γ of the scorpion Tityus serrulatus modifies both activation and inactivation of sodium permeability of nerve membrane","article_type":"original","external_id":{"pmid":["2426654 "]},"publication":"Pflugers Archiv : European Journal of Physiology","year":"1986"},{"date_created":"2018-12-11T12:04:04Z","month":"01","article_processing_charge":"No","publication_identifier":{"issn":["0384-9864"]},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","page":"193 - 200","publication_status":"published","extern":"1","publist_id":"2806","article_type":"original","title":"How often can you see yourself in a convex configuration of mirrors?","date_published":"1986-01-01T00:00:00Z","volume":53,"year":"1986","status":"public","publication":"Congressus Numerantium","day":"01","intvolume":"        53","publisher":"Utilitas Mathemtica Publ. Inc.","type":"journal_article","date_updated":"2022-02-02T15:58:04Z","oa_version":"None","quality_controlled":"1","citation":{"chicago":"Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” <i>Congressus Numerantium</i>. Utilitas Mathemtica Publ. Inc., 1986.","apa":"Edelsbrunner, H., &#38; Jaromczyk, J. (1986). How often can you see yourself in a convex configuration of mirrors? <i>Congressus Numerantium</i>. Utilitas Mathemtica Publ. Inc.","short":"H. Edelsbrunner, J. Jaromczyk, Congressus Numerantium 53 (1986) 193–200.","ama":"Edelsbrunner H, Jaromczyk J. How often can you see yourself in a convex configuration of mirrors? <i>Congressus Numerantium</i>. 1986;53:193-200.","ista":"Edelsbrunner H, Jaromczyk J. 1986. How often can you see yourself in a convex configuration of mirrors? Congressus Numerantium. 53, 193–200.","ieee":"H. Edelsbrunner and J. Jaromczyk, “How often can you see yourself in a convex configuration of mirrors?,” <i>Congressus Numerantium</i>, vol. 53. Utilitas Mathemtica Publ. Inc., pp. 193–200, 1986.","mla":"Edelsbrunner, Herbert, and Jerzy Jaromczyk. “How Often Can You See Yourself in a Convex Configuration of Mirrors?” <i>Congressus Numerantium</i>, vol. 53, Utilitas Mathemtica Publ. Inc., 1986, pp. 193–200."},"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Jerzy","last_name":"Jaromczyk","full_name":"Jaromczyk, Jerzy"}],"language":[{"iso":"eng"}],"_id":"3579"},{"date_published":"1986-11-01T00:00:00Z","status":"public","abstract":[{"text":"An edge-skeleton in an arrangementA(H) of a finite set of planes inE 3 is a connected collection of edges inA(H). We give a method that constructs a skeleton inO(√n logn) time per edge. This method implies new and more efficient algorithms for a number of structures in computational geometry including order-k power diagrams inE 2 and space cutting trees inE 3.\r\nWe also give a novel method for handling special cases which has the potential to substantially decrease the amount of effort needed to implement geometric algorithms.","lang":"eng"}],"publication_status":"published","extern":"1","doi":"10.1007/BF01840438","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"11","language":[{"iso":"eng"}],"issue":"1-4","date_updated":"2022-02-02T09:36:32Z","oa_version":"None","day":"01","title":"Edge-skeletons in arrangements with applications","article_type":"original","volume":1,"year":"1986","publication":"Algorithmica","page":"93 - 109","publist_id":"2805","date_created":"2018-12-11T12:04:04Z","article_processing_charge":"No","publication_identifier":{"eissn":["1432-0541"],"issn":["0178-4617"]},"author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"}],"_id":"3580","quality_controlled":"1","scopus_import":"1","citation":{"ieee":"H. Edelsbrunner, “Edge-skeletons in arrangements with applications,” <i>Algorithmica</i>, vol. 1, no. 1–4. Springer, pp. 93–109, 1986.","mla":"Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” <i>Algorithmica</i>, vol. 1, no. 1–4, Springer, 1986, pp. 93–109, doi:<a href=\"https://doi.org/10.1007/BF01840438\">10.1007/BF01840438</a>.","ista":"Edelsbrunner H. 1986. Edge-skeletons in arrangements with applications. Algorithmica. 1(1–4), 93–109.","ama":"Edelsbrunner H. Edge-skeletons in arrangements with applications. <i>Algorithmica</i>. 1986;1(1-4):93-109. doi:<a href=\"https://doi.org/10.1007/BF01840438\">10.1007/BF01840438</a>","apa":"Edelsbrunner, H. (1986). Edge-skeletons in arrangements with applications. <i>Algorithmica</i>. Springer. <a href=\"https://doi.org/10.1007/BF01840438\">https://doi.org/10.1007/BF01840438</a>","short":"H. Edelsbrunner, Algorithmica 1 (1986) 93–109.","chicago":"Edelsbrunner, Herbert. “Edge-Skeletons in Arrangements with Applications.” <i>Algorithmica</i>. Springer, 1986. <a href=\"https://doi.org/10.1007/BF01840438\">https://doi.org/10.1007/BF01840438</a>."},"type":"journal_article","intvolume":"         1","publisher":"Springer"},{"publication":"Theoretical Population Biology","year":"1986","volume":29,"article_type":"original","title":"Intrachromosomal gene conversion, linkage, and the evolution of multigene families","publist_id":"2721","page":"407 - 437","publication_identifier":{"issn":["0040-5809"],"eissn":["1096-0325"]},"article_processing_charge":"No","acknowledgement":"Supported by National Science Foundation Grant DEB81-03530","date_created":"2018-12-11T12:04:30Z","_id":"3662","author":[{"first_name":"Thomas","last_name":"Nagylaki","full_name":"Nagylaki, Thomas"},{"id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","full_name":"Barton, Nicholas H"}],"citation":{"ama":"Nagylaki T, Barton NH. Intrachromosomal gene conversion, linkage, and the evolution of multigene families. <i>Theoretical Population Biology</i>. 1986;29(3):407-437. doi:<a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">10.1016/0040-5809(86)90017-1</a>","ista":"Nagylaki T, Barton NH. 1986. Intrachromosomal gene conversion, linkage, and the evolution of multigene families. Theoretical Population Biology. 29(3), 407–437.","ieee":"T. Nagylaki and N. H. Barton, “Intrachromosomal gene conversion, linkage, and the evolution of multigene families,” <i>Theoretical Population Biology</i>, vol. 29, no. 3. Academic Press, pp. 407–437, 1986.","mla":"Nagylaki, Thomas, and Nicholas H. Barton. “Intrachromosomal Gene Conversion, Linkage, and the Evolution of Multigene Families.” <i>Theoretical Population Biology</i>, vol. 29, no. 3, Academic Press, 1986, pp. 407–37, doi:<a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">10.1016/0040-5809(86)90017-1</a>.","chicago":"Nagylaki, Thomas, and Nicholas H Barton. “Intrachromosomal Gene Conversion, Linkage, and the Evolution of Multigene Families.” <i>Theoretical Population Biology</i>. Academic Press, 1986. <a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">https://doi.org/10.1016/0040-5809(86)90017-1</a>.","apa":"Nagylaki, T., &#38; Barton, N. H. (1986). Intrachromosomal gene conversion, linkage, and the evolution of multigene families. <i>Theoretical Population Biology</i>. Academic Press. <a href=\"https://doi.org/10.1016/0040-5809(86)90017-1\">https://doi.org/10.1016/0040-5809(86)90017-1</a>","short":"T. Nagylaki, N.H. Barton, Theoretical Population Biology 29 (1986) 407–437."},"quality_controlled":"1","scopus_import":"1","type":"journal_article","publisher":"Academic Press","intvolume":"        29","status":"public","date_published":"1986-06-01T00:00:00Z","extern":"1","abstract":[{"lang":"eng","text":"The evolution of the probabilities of genetic identity within and between tandemly repeated loci of a multigene family is investigated analytically and numerically. Unbiased intrachromosomal gene conversion, equal crossing over, random genetic drift, and mutation to new alleles are incorporated. Generations are discrete and nonoverlapping; the diploid, monoecious population mates at random. Under the restriction that there is at most one crossover in the multigene family per individual per generation, the dependence on location of the probabilities of identity is treated exactly. In the “homogeneous” approximation to this “exact” model, end effects are disregarded; in the “exchangeable” approximation, to which all previous work was confined, all position dependence is neglected. Numerical results indicate that (i) the exchangeable and homogeneous models are both qualitatively correct, (ii) the exchangeable model is sometimes too inaccurate for quantitative conclusions, and (iii) the homogeneous model is always more accurate than the exchangeable one and is always sufficiently accurate for quantitative conclusions."}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1016/0040-5809(86)90017-1","month":"06","language":[{"iso":"eng"}],"oa_version":"None","date_updated":"2022-02-01T15:50:10Z","issue":"3","day":"01"},{"oa":1,"language":[{"iso":"eng"}],"date_updated":"2022-02-01T15:04:01Z","oa_version":"None","issue":"3","day":"01","status":"public","date_published":"1986-06-01T00:00:00Z","extern":"1","publication_status":"published","abstract":[{"text":"The conditional average frequency of rare alleles has been shown in simulations to provide a simple and robust estimator of the number of individuals exchanged between local populations in an island model (Nm). This statistic is defined as the average frequency of an allele in those samples in which the allele is present. Here, we show that the conditional average frequency can be calculated from the distribution of allele frequencies. It is a measure of the spread of this distribution, and so is analogous to the standardised variance, FST. Analytic predictions for the island model of migration agree well with the corresponding simulation results. These predictions are based on the assumption that the rare alleles found in samples have reached a &quot;quasi-equilibrium&quot; distribution. As well as relating the conditional average frequency to the underlying allele frequency distribution, our results provide a more accurate method of estimating Nm from the conditional average frequency of private alleles in samples of different sizes.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1038/hdy.1986.63","pmid":1,"main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy198663"}],"month":"06","_id":"3663","author":[{"full_name":"Barton, Nicholas H","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","last_name":"Barton","first_name":"Nicholas H"},{"full_name":"Slatkin, Montgomery","first_name":"Montgomery","last_name":"Slatkin"}],"citation":{"mla":"Barton, Nicholas H., and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” <i>Heredity</i>, vol. 56, no. 3, Nature Publishing Group, 1986, pp. 409–16, doi:<a href=\"https://doi.org/10.1038/hdy.1986.63\">10.1038/hdy.1986.63</a>.","ieee":"N. H. Barton and M. Slatkin, “A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population,” <i>Heredity</i>, vol. 56, no. 3. Nature Publishing Group, pp. 409–416, 1986.","ista":"Barton NH, Slatkin M. 1986. A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. Heredity. 56(3), 409–416.","ama":"Barton NH, Slatkin M. A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. <i>Heredity</i>. 1986;56(3):409-416. doi:<a href=\"https://doi.org/10.1038/hdy.1986.63\">10.1038/hdy.1986.63</a>","apa":"Barton, N. H., &#38; Slatkin, M. (1986). A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population. <i>Heredity</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/hdy.1986.63\">https://doi.org/10.1038/hdy.1986.63</a>","short":"N.H. Barton, M. Slatkin, Heredity 56 (1986) 409–416.","chicago":"Barton, Nicholas H, and Montgomery Slatkin. “A Quasi-Equilibrium Theory of the Distribution of Rare Alleles in a Subdivided Population.” <i>Heredity</i>. Nature Publishing Group, 1986. <a href=\"https://doi.org/10.1038/hdy.1986.63\">https://doi.org/10.1038/hdy.1986.63</a>."},"scopus_import":"1","quality_controlled":"1","type":"journal_article","publisher":"Nature Publishing Group","intvolume":"        56","publication":"Heredity","year":"1986","volume":56,"article_type":"original","external_id":{"pmid":["3733460 "]},"title":"A quasi-equilibrium theory of the distribution of rare alleles in a subdivided population","publist_id":"2720","page":"409 - 416","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"article_processing_charge":"No","date_created":"2018-12-11T12:04:30Z","acknowledgement":"This research has been supported in part by grants from the Royal Society of London, S.E.R.C., and the National Science Foundation. We thank J. Felsenstein for helpful discussions of this problem."},{"publication":"Heredity","year":"1986","volume":57,"article_type":"original","title":"The barrier to genetic exchange between hybridising populations","publist_id":"2719","page":"357 - 376","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"article_processing_charge":"No","date_created":"2018-12-11T12:04:30Z","_id":"3664","author":[{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240"},{"full_name":"Bengtsson, Bengt","last_name":"Bengtsson","first_name":"Bengt"}],"citation":{"apa":"Barton, N. H., &#38; Bengtsson, B. (1986). The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. Nature Publishing Group.","short":"N.H. Barton, B. Bengtsson, Heredity 57 (1986) 357–376.","chicago":"Barton, Nicholas H, and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>. Nature Publishing Group, 1986.","ieee":"N. H. Barton and B. Bengtsson, “The barrier to genetic exchange between hybridising populations,” <i>Heredity</i>, vol. 57. Nature Publishing Group, pp. 357–376, 1986.","ista":"Barton NH, Bengtsson B. 1986. The barrier to genetic exchange between hybridising populations. Heredity. 57, 357–376.","mla":"Barton, Nicholas H., and Bengt Bengtsson. “The Barrier to Genetic Exchange between Hybridising Populations.” <i>Heredity</i>, vol. 57, Nature Publishing Group, 1986, pp. 357–76.","ama":"Barton NH, Bengtsson B. The barrier to genetic exchange between hybridising populations. <i>Heredity</i>. 1986;57:357-376."},"quality_controlled":"1","scopus_import":"1","type":"journal_article","publisher":"Nature Publishing Group","intvolume":"        57","status":"public","date_published":"1986-01-01T00:00:00Z","extern":"1","abstract":[{"text":"Suppose that selection acts at one or more loci to maintain genetic differences between hybridising populations. Then, the flow of alleles at a neutral marker locus which is linked to these selected loci will be impeded. We define and calculate measures of the barrier to gene flow between two distinct demes, and across a continuous habitat. In both cases, we find that in order for gene flow to be significantly reduced over much of the genome, hybrids must be substantially less fit, and the number of genes involved in building the barrier must be so large that the majority of other genes become closely linked to some locus which is under selection. This conclusion is not greatly affected by the pattern of epistasis, or the position of the marker locus along the chromosome.","lang":"eng"}],"publication_status":"published","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.nature.com/articles/hdy1986135","open_access":"1"}],"month":"01","language":[{"iso":"eng"}],"oa":1,"date_updated":"2022-02-01T14:49:02Z","oa_version":"Published Version","day":"01"},{"day":"01","language":[{"iso":"eng"}],"oa":1,"date_updated":"2022-02-01T14:31:29Z","oa_version":"Published Version","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"open_access":"1","url":"https://www.nature.com/articles/hdy1986142"}],"month":"01","status":"public","date_published":"1986-01-01T00:00:00Z","extern":"1","abstract":[{"text":"The rate of gene flow across a hybrid zone may be reduced by the presence of a physical barrier, by a reduction of population density caused by reduced fitness of hybrids (the “hybrid sink” effect), and by linkage. If the reduction in hybrid fitness is not extreme, the strength of the barrier to gene flow caused by these effects is. Here, w is the width of the cline; ρ* is the carrying capacity; W̄* is the mean fitness of the population, excluding effects of density; R is the strength of density-dependent regulation; and r̄ is the harmonic mean recombination rate between the locus whose flow is being calculated, and loci under selection. +, 0 denote populations outside the hybrid zone, and at its centre, respectively. This relation is illustrated using data from hybrid ones in Bombina and Podisma, and its implications for interpretation of data from nature are discussed.","lang":"eng"}],"publication_status":"published","type":"journal_article","publisher":"Nature Publishing Group","intvolume":"        57","_id":"3665","author":[{"first_name":"Nicholas H","orcid":"0000-0002-8548-5240","last_name":"Barton","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"citation":{"mla":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>, vol. 57, Nature Publishing Group, 1986, pp. 415–26.","ista":"Barton NH. 1986. The effects of linkage and density-dependent regulation on gene flow. Heredity. 57, 415–426.","ieee":"N. H. Barton, “The effects of linkage and density-dependent regulation on gene flow,” <i>Heredity</i>, vol. 57. Nature Publishing Group, pp. 415–426, 1986.","ama":"Barton NH. The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. 1986;57:415-426.","apa":"Barton, N. H. (1986). The effects of linkage and density-dependent regulation on gene flow. <i>Heredity</i>. Nature Publishing Group.","short":"N.H. Barton, Heredity 57 (1986) 415–426.","chicago":"Barton, Nicholas H. “The Effects of Linkage and Density-Dependent Regulation on Gene Flow.” <i>Heredity</i>. Nature Publishing Group, 1986."},"scopus_import":"1","quality_controlled":"1","publication_identifier":{"eissn":["1365-2540"],"issn":["0018-067X"]},"article_processing_charge":"No","acknowledgement":"I would like to thank Shahin Rouhani and Richard Nichols for their helpful comments on the manuscript, and the latter for providing the data used in fig. 3. This work was supported by a grant from the Science and Engineering Research Council (GR/C/91529).","date_created":"2018-12-11T12:04:30Z","publication":"Heredity","year":"1986","volume":57,"title":"The effects of linkage and density-dependent regulation on gene flow","article_type":"original","publist_id":"2718","page":"415 - 426"},{"publication_identifier":{"issn":["0097-3165"],"eissn":["1096-0899"]},"date_created":"2018-12-11T12:06:56Z","article_processing_charge":"No","year":"1986","publication":"Journal of Combinatorial Theory Series A","article_type":"original","title":"The number of extreme pairs of finite point-sets in Euclidean spaces","volume":43,"page":"344 - 349","publist_id":"2020","type":"journal_article","publisher":"Elsevier","intvolume":"        43","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Stöckl","first_name":"Gerd","full_name":"Stöckl, Gerd"}],"_id":"4098","citation":{"short":"H. Edelsbrunner, G. Stöckl, Journal of Combinatorial Theory Series A 43 (1986) 344–349.","apa":"Edelsbrunner, H., &#38; Stöckl, G. (1986). The number of extreme pairs of finite point-sets in Euclidean spaces. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">https://doi.org/10.1016/0097-3165(86)90075-0</a>","chicago":"Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">https://doi.org/10.1016/0097-3165(86)90075-0</a>.","ista":"Edelsbrunner H, Stöckl G. 1986. The number of extreme pairs of finite point-sets in Euclidean spaces. Journal of Combinatorial Theory Series A. 43(2), 344–349.","mla":"Edelsbrunner, Herbert, and Gerd Stöckl. “The Number of Extreme Pairs of Finite Point-Sets in Euclidean Spaces.” <i>Journal of Combinatorial Theory Series A</i>, vol. 43, no. 2, Elsevier, 1986, pp. 344–49, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">10.1016/0097-3165(86)90075-0</a>.","ieee":"H. Edelsbrunner and G. Stöckl, “The number of extreme pairs of finite point-sets in Euclidean spaces,” <i>Journal of Combinatorial Theory Series A</i>, vol. 43, no. 2. Elsevier, pp. 344–349, 1986.","ama":"Edelsbrunner H, Stöckl G. The number of extreme pairs of finite point-sets in Euclidean spaces. <i>Journal of Combinatorial Theory Series A</i>. 1986;43(2):344-349. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90075-0\">10.1016/0097-3165(86)90075-0</a>"},"scopus_import":"1","quality_controlled":"1","doi":"10.1016/0097-3165(86)90075-0","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0097316586900750?via%3Dihub","open_access":"1"}],"month":"11","status":"public","date_published":"1986-11-01T00:00:00Z","publication_status":"published","abstract":[{"text":"To points p and q of a finite set S in d-dimensional Euclidean space Ed are extreme if {p, q} = S ∩ h, for some open halfspace h. Let e2(d)(n) be the maximum number of extreme pairs realized by any n points in Ed. We give geometric proofs of , if n⩾4, and e2(3)(n) = 3n−6, if n⩾6. These results settle the question since all other cases are trivial.","lang":"eng"}],"extern":"1","day":"01","oa":1,"language":[{"iso":"eng"}],"issue":"2","oa_version":"None","date_updated":"2022-02-01T14:02:41Z"},{"publication_identifier":{"eissn":["1872-6119"],"issn":["0020-0190"]},"article_processing_charge":"No","date_created":"2018-12-11T12:06:56Z","acknowledgement":"We thank W. Bucher for help in the analysis of the time complexity of the query algorithm. ","publication":"Information Processing Letters","year":"1986","volume":23,"article_type":"original","title":"Halfplanar range search in linear space and O(n0.695) query time","publist_id":"2021","page":"289 - 293","type":"journal_article","publisher":"Elsevier","intvolume":"        23","_id":"4099","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Emo","last_name":"Welzl","full_name":"Welzl, Emo"}],"citation":{"chicago":"Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.” <i>Information Processing Letters</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">https://doi.org/10.1016/0020-0190(86)90088-8</a>.","apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). Halfplanar range search in linear space and O(n0.695) query time. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">https://doi.org/10.1016/0020-0190(86)90088-8</a>","short":"H. Edelsbrunner, E. Welzl, Information Processing Letters 23 (1986) 289–293.","ama":"Edelsbrunner H, Welzl E. Halfplanar range search in linear space and O(n0.695) query time. <i>Information Processing Letters</i>. 1986;23(5):289-293. doi:<a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">10.1016/0020-0190(86)90088-8</a>","ista":"Edelsbrunner H, Welzl E. 1986. Halfplanar range search in linear space and O(n0.695) query time. Information Processing Letters. 23(5), 289–293.","ieee":"H. Edelsbrunner and E. Welzl, “Halfplanar range search in linear space and O(n0.695) query time,” <i>Information Processing Letters</i>, vol. 23, no. 5. Elsevier, pp. 289–293, 1986.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “Halfplanar Range Search in Linear Space and O(N0.695) Query Time.” <i>Information Processing Letters</i>, vol. 23, no. 5, Elsevier, 1986, pp. 289–93, doi:<a href=\"https://doi.org/10.1016/0020-0190(86)90088-8\">10.1016/0020-0190(86)90088-8</a>."},"quality_controlled":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1016/0020-0190(86)90088-8","month":"11","status":"public","date_published":"1986-11-24T00:00:00Z","extern":"1","abstract":[{"text":"Let S denote a set of n points in the Euclidean plane. A halfplanar range query specifies a halfplane h and requires the determination of the number of points in S which are contained in h. A new data structure is described which stores S in O(n) space and allows us to answer a halfplanar range query in O(nlog2(1+√5)−1) time in the worst case, thus improving the best result known before. The structure can be built in O(n log n) time.","lang":"eng"}],"publication_status":"published","day":"24","language":[{"iso":"eng"}],"date_updated":"2022-02-01T14:17:10Z","oa_version":"None","issue":"5"},{"title":"On the maximal number of edges of many faces in an arrangement","volume":41,"year":"1986","publication":"Journal of Combinatorial Theory Series A","page":"159 - 166","publist_id":"2015","acknowledgement":"The second author thanks Gan Gusfield for useful discussion.","date_created":"2018-12-11T12:06:57Z","article_processing_charge":"No","publication_identifier":{"issn":["0097-3165"],"eissn":["1096-0899"]},"author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Welzl","first_name":"Emo","full_name":"Welzl, Emo"}],"_id":"4103","quality_controlled":"1","scopus_import":"1","citation":{"apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>","short":"H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166.","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>.","ieee":"H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.","ista":"Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>.","ama":"Edelsbrunner H, Welzl E. On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. 1986;41(2):159-166. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>"},"type":"journal_article","intvolume":"        41","publisher":"Elsevier","date_published":"1986-11-01T00:00:00Z","status":"public","abstract":[{"text":"Let A be an arrangement of n lines in the plane. Suppose F1,…, Fk are faces in the dissection induced by A and that Fi is a t(Fi)-gon. We give asymptotic bounds on the maximal sum ∑i=1kt(Fi) which can be realized by k different faces in an arrangement of n lines. The results improve known bounds for k of higher order than n(1/2).","lang":"eng"}],"publication_status":"published","extern":"1","doi":"10.1016/0097-3165(86)90078-6","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","month":"11","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0097316586900786?via%3Dihub","open_access":"1"}],"oa":1,"language":[{"iso":"eng"}],"issue":"2","date_updated":"2022-02-01T09:46:55Z","oa_version":"Published Version","day":"01"},{"_id":"4104","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"full_name":"Stolfi, Jorge","last_name":"Stolfi","first_name":"Jorge"}],"citation":{"ama":"Edelsbrunner H, Guibas L, Stolfi J. Optimal point location in a monotone subdivision. <i>SIAM Journal on Computing</i>. 1986;15(2):317-340. doi:<a href=\"https://doi.org/10.1137/0215023\">10.1137/0215023</a>","ieee":"H. Edelsbrunner, L. Guibas, and J. Stolfi, “Optimal point location in a monotone subdivision,” <i>SIAM Journal on Computing</i>, vol. 15, no. 2. SIAM, pp. 317–340, 1986.","mla":"Edelsbrunner, Herbert, et al. “Optimal Point Location in a Monotone Subdivision.” <i>SIAM Journal on Computing</i>, vol. 15, no. 2, SIAM, 1986, pp. 317–40, doi:<a href=\"https://doi.org/10.1137/0215023\">10.1137/0215023</a>.","ista":"Edelsbrunner H, Guibas L, Stolfi J. 1986. Optimal point location in a monotone subdivision. SIAM Journal on Computing. 15(2), 317–340.","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Jorge Stolfi. “Optimal Point Location in a Monotone Subdivision.” <i>SIAM Journal on Computing</i>. SIAM, 1986. <a href=\"https://doi.org/10.1137/0215023\">https://doi.org/10.1137/0215023</a>.","short":"H. Edelsbrunner, L. Guibas, J. Stolfi, SIAM Journal on Computing 15 (1986) 317–340.","apa":"Edelsbrunner, H., Guibas, L., &#38; Stolfi, J. (1986). Optimal point location in a monotone subdivision. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0215023\">https://doi.org/10.1137/0215023</a>"},"scopus_import":"1","quality_controlled":"1","type":"journal_article","publisher":"SIAM","intvolume":"        15","publication":"SIAM Journal on Computing","year":"1986","volume":15,"article_type":"original","title":"Optimal point location in a monotone subdivision","publist_id":"2016","page":"317 - 340","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"article_processing_charge":"No","date_created":"2018-12-11T12:06:58Z","acknowledgement":"We would like to thank Andrei Broder, Dan Greene, Mary Claire van Leunen, Greg Nelson, Lyle Ramshaw, and F. Frances Yao, whose comments and suggestions have greatly improved the readability of this paper.","language":[{"iso":"eng"}],"date_updated":"2022-02-01T10:05:55Z","oa_version":"None","issue":"2","day":"01","status":"public","date_published":"1986-01-01T00:00:00Z","extern":"1","publication_status":"published","abstract":[{"text":"Point location, often known in graphics as “hit detection,” is one of the fundamental problems of computational geometry. In a point location query we want to identify which of a given collection of geometric objects contains a particular point. Let $\\mathcal{S}$ denote a subdivision of the Euclidean plane into monotone regions by a straight-line graph of $m$ edges. In this paper we exhibit a substantial refinement of the technique of Lee and Preparata [SIAM J. Comput., 6 (1977), pp. 594–606] for locating a point in $\\mathcal{S}$ based on separating chains. The new data structure, called a layered dag, can be built in $O(m)$ time, uses $O(m)$ storage, and makes possible point location in $O(\\log m)$ time. Unlike previous structures that attain these optimal bounds, the layered dag can be implemented in a simple and practical way, and is extensible to subdivisions with edges more general than straight-line segments.\r\n© 1986 Society for Industrial and Applied Mathematics","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1137/0215023","month":"01"},{"date_published":"1986-01-01T00:00:00Z","status":"public","extern":"1","publication_status":"published","abstract":[{"text":"A finite set of lines partitions the Euclidean plane into a cell complex. Similarly, a finite set of $(d - 1)$-dimensional hyperplanes partitions $d$-dimensional Euclidean space. An algorithm is presented that constructs a representation for the cell complex defined by $n$ hyperplanes in optimal $O(n^d )$ time in $d$ dimensions. It relies on a combinatorial result that is of interest in its own right. The algorithm is shown to lead to new methods for computing $\\lambda $-matrices, constructing all higher-order Voronoi diagrams, halfspatial range estimation, degeneracy testing, and finding minimum measure simplices. In all five applications, the new algorithms are asymptotically faster than previous results, and in several cases are the only known methods that generalize to arbitrary dimensions. The algorithm also implies an upper bound of $2^{cn^d } $, $c$ a positive constant, for the number of combinatorially distinct arrangements of $n$ hyperplanes in $E^d $.\r\n© 1986 Society for Industrial and Applied Mathematics","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1137/0215024","month":"01","language":[{"iso":"eng"}],"date_updated":"2022-02-01T11:03:07Z","oa_version":"None","issue":"2","day":"01","volume":15,"title":"Constructing arrangements of lines and hyperplanes with applications","article_type":"original","publication":"SIAM Journal on Computing","year":"1986","publist_id":"2017","page":"341 - 363","article_processing_charge":"No","date_created":"2018-12-11T12:06:58Z","acknowledgement":"We thank Emmerich Welzl for discussions on Theorem 2.7. We also thank Friedrich Huber for implementing the \r\nconstruction of arrangements in arbitrary dimensions, and Gerd Stoeckl for implementing the algorithms presented in §§\r\n4.1 and 4.3. The third author wishes to thank Jack Edmonds for the many enlightening discussions.\r\n","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"_id":"4105","author":[{"first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Joseph","last_name":"O'Rourke","full_name":"O'Rourke, Joseph"},{"full_name":"Seidel, Raimund","last_name":"Seidel","first_name":"Raimund"}],"scopus_import":"1","quality_controlled":"1","citation":{"ieee":"H. Edelsbrunner, J. O’Rourke, and R. Seidel, “Constructing arrangements of lines and hyperplanes with applications,” <i>SIAM Journal on Computing</i>, vol. 15, no. 2. SIAM, pp. 341–363, 1986.","mla":"Edelsbrunner, Herbert, et al. “Constructing Arrangements of Lines and Hyperplanes with Applications.” <i>SIAM Journal on Computing</i>, vol. 15, no. 2, SIAM, 1986, pp. 341–63, doi:<a href=\"https://doi.org/10.1137/0215024\">10.1137/0215024</a>.","ista":"Edelsbrunner H, O’Rourke J, Seidel R. 1986. Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing. 15(2), 341–363.","ama":"Edelsbrunner H, O’Rourke J, Seidel R. Constructing arrangements of lines and hyperplanes with applications. <i>SIAM Journal on Computing</i>. 1986;15(2):341-363. doi:<a href=\"https://doi.org/10.1137/0215024\">10.1137/0215024</a>","short":"H. Edelsbrunner, J. O’Rourke, R. Seidel, SIAM Journal on Computing 15 (1986) 341–363.","apa":"Edelsbrunner, H., O’Rourke, J., &#38; Seidel, R. (1986). Constructing arrangements of lines and hyperplanes with applications. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0215024\">https://doi.org/10.1137/0215024</a>","chicago":"Edelsbrunner, Herbert, Joseph O’Rourke, and Raimund Seidel. “Constructing Arrangements of Lines and Hyperplanes with Applications.” <i>SIAM Journal on Computing</i>. SIAM, 1986. <a href=\"https://doi.org/10.1137/0215024\">https://doi.org/10.1137/0215024</a>."},"type":"journal_article","intvolume":"        15","publisher":"SIAM"},{"day":"01","language":[{"iso":"eng"}],"oa_version":"None","date_updated":"2022-02-01T11:22:59Z","issue":"2","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","doi":"10.1016/S0747-7171(86)80020-7","month":"01","date_published":"1986-01-01T00:00:00Z","status":"public","extern":"1","abstract":[{"text":"Let B be a set of nb black points and W a set of nw, white points in the Euclidean plane. A line h is said to bisect B (or W) if, at most, half of the points of B (or W) lie on any one side of h. A line that bisects both B and W is called a ham-sandwich cut of B and W. We give an algorithm that computes a ham-sandwich cut of B and W in 0((nh+nw) log (min {nb, nw}+ 1)) time. The algorithm is considerably simpler than the previous most efficient one which takes 0((nb + nw) log (nb + nw)) time.","lang":"eng"}],"publication_status":"published","type":"journal_article","intvolume":"         2","publisher":"Elsevier","_id":"4106","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"full_name":"Waupotitsch, Roman","first_name":"Roman","last_name":"Waupotitsch"}],"quality_controlled":"1","scopus_import":"1","citation":{"ama":"Edelsbrunner H, Waupotitsch R. Computing a ham-sandwich cut in two dimensions. <i>Journal of Symbolic Computation</i>. 1986;2(2):171-178. doi:<a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">10.1016/S0747-7171(86)80020-7</a>","ista":"Edelsbrunner H, Waupotitsch R. 1986. Computing a ham-sandwich cut in two dimensions. Journal of Symbolic Computation. 2(2), 171–178.","ieee":"H. Edelsbrunner and R. Waupotitsch, “Computing a ham-sandwich cut in two dimensions,” <i>Journal of Symbolic Computation</i>, vol. 2, no. 2. Elsevier, pp. 171–178, 1986.","mla":"Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” <i>Journal of Symbolic Computation</i>, vol. 2, no. 2, Elsevier, 1986, pp. 171–78, doi:<a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">10.1016/S0747-7171(86)80020-7</a>.","chicago":"Edelsbrunner, Herbert, and Roman Waupotitsch. “Computing a Ham-Sandwich Cut in Two Dimensions.” <i>Journal of Symbolic Computation</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">https://doi.org/10.1016/S0747-7171(86)80020-7</a>.","apa":"Edelsbrunner, H., &#38; Waupotitsch, R. (1986). Computing a ham-sandwich cut in two dimensions. <i>Journal of Symbolic Computation</i>. Elsevier. <a href=\"https://doi.org/10.1016/S0747-7171(86)80020-7\">https://doi.org/10.1016/S0747-7171(86)80020-7</a>","short":"H. Edelsbrunner, R. Waupotitsch, Journal of Symbolic Computation 2 (1986) 171–178."},"article_processing_charge":"No","date_created":"2018-12-11T12:06:58Z","publication_identifier":{"issn":["0747-7171"],"eissn":["1095-855X"]},"volume":2,"article_type":"original","title":"Computing a ham-sandwich cut in two dimensions","publication":"Journal of Symbolic Computation","year":"1986","publist_id":"2018","page":"171 - 178"}]