[{"intvolume":"        43","citation":{"ama":"Mallet J, Barton NH. Strong natural selection in a warning color hybrid zone. <i>Evolution</i>. 1989;43(2):421-431. doi:<a href=\"https://doi.org/10.2307/2409217 \">10.2307/2409217 </a>","mla":"Mallet, James, and Nicholas H. Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” <i>Evolution</i>, vol. 43, no. 2, Wiley-Blackwell, 1989, pp. 421–31, doi:<a href=\"https://doi.org/10.2307/2409217 \">10.2307/2409217 </a>.","chicago":"Mallet, James, and Nicholas H Barton. “Strong Natural Selection in a Warning Color Hybrid Zone.” <i>Evolution</i>. Wiley-Blackwell, 1989. <a href=\"https://doi.org/10.2307/2409217 \">https://doi.org/10.2307/2409217 </a>.","ista":"Mallet J, Barton NH. 1989. Strong natural selection in a warning color hybrid zone. Evolution. 43(2), 421–431.","apa":"Mallet, J., &#38; Barton, N. H. (1989). Strong natural selection in a warning color hybrid zone. <i>Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.2307/2409217 \">https://doi.org/10.2307/2409217 </a>","ieee":"J. Mallet and N. H. Barton, “Strong natural selection in a warning color hybrid zone,” <i>Evolution</i>, vol. 43, no. 2. Wiley-Blackwell, pp. 421–431, 1989.","short":"J. Mallet, N.H. Barton, Evolution 43 (1989) 421–431."},"main_file_link":[{"url":"https://www.jstor.org/stable/2409217?origin=crossref&seq=1#metadata_info_tab_contents"}],"status":"public","pmid":1,"acknowledgement":"We thank G.Lamas for sharing his knowledge of the Tarapoto hybrid zone;  M.A.Arboleda, H.Eeley, S.Knapp, M.Muedas, and J.Santisteban for their help in the field;  P.Donnelly and C.Smith for statistical advice; and S.Jones, S.Knapp, G.Lamas, and the reviewers for helpful comments on the manuscript. We are grateful to the Natural Environment Research Council, the Royal Society, and the Nuffield Foundation for funding this research.","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Frequency-dependent selection on warning color can maintain narrow hybrid zones between unpalatable prey taxa. To measure such selection, we transferred marked Heliconius erato (Lepidoptera: Nymphalidae) in both directions across a 10-km-wide hybrid zone between Peruvian races differing in color pattern. These experimental H. erato were released at four sites, along with control H. erato of the phenotype native to each site. Survival of experimental butterflies was significantly lower than that of controls at two sites and overall. Most selection, measured as differences in survival, occurred soon after release. Selection against foreign morphs was 52% (confidence limits: 25-71%) and was probably due to bird attacks on unusual warning-color morphs (more than 10% of the recaptures had beak marks). Since only three major loci determine the color-pattern differences, this suggests an average selection coefficient of 0.17 per locus, sufficient to maintain the narrow clines in H. erato."}],"title":"Strong natural selection in a warning color hybrid zone","_id":"3653","publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"issue":"2","scopus_import":"1","article_type":"original","external_id":{"pmid":["28568556 "]},"oa_version":"None","type":"journal_article","date_published":"1989-01-01T00:00:00Z","volume":43,"month":"01","quality_controlled":"1","extern":"1","article_processing_charge":"No","date_updated":"2022-02-14T11:00:42Z","publisher":"Wiley-Blackwell","doi":"10.2307/2409217 ","publication":"Evolution","date_created":"2018-12-11T12:04:27Z","day":"01","publist_id":"2730","publication_status":"published","author":[{"last_name":"Mallet","full_name":"Mallet, James","first_name":"James"},{"full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8548-5240","last_name":"Barton"}],"page":"421 - 431","year":"1989","language":[{"iso":"eng"}]},{"date_created":"2018-12-11T12:04:27Z","day":"12","publication_status":"published","publist_id":"2729","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"last_name":"Hewitt","full_name":"Hewitt, Godfrey","first_name":"Godfrey"}],"page":"497 - 503","language":[{"iso":"eng"}],"year":"1989","external_id":{"pmid":["2677747 "]},"article_type":"original","oa_version":"None","type":"journal_article","date_published":"1989-10-12T00:00:00Z","volume":341,"month":"10","quality_controlled":"1","extern":"1","article_processing_charge":"No","doi":"10.1038/341497a0","publisher":"Nature Publishing Group","date_updated":"2022-02-14T10:13:44Z","publication":"Nature","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"scopus_import":"1","intvolume":"       341","citation":{"chicago":"Barton, Nicholas H, and Godfrey Hewitt. “Adaptation, Speciation and Hybrid Zones.” <i>Nature</i>. Nature Publishing Group, 1989. <a href=\"https://doi.org/10.1038/341497a0\">https://doi.org/10.1038/341497a0</a>.","mla":"Barton, Nicholas H., and Godfrey Hewitt. “Adaptation, Speciation and Hybrid Zones.” <i>Nature</i>, vol. 341, Nature Publishing Group, 1989, pp. 497–503, doi:<a href=\"https://doi.org/10.1038/341497a0\">10.1038/341497a0</a>.","ama":"Barton NH, Hewitt G. Adaptation, speciation and hybrid zones. <i>Nature</i>. 1989;341:497-503. doi:<a href=\"https://doi.org/10.1038/341497a0\">10.1038/341497a0</a>","short":"N.H. Barton, G. Hewitt, Nature 341 (1989) 497–503.","ieee":"N. H. Barton and G. Hewitt, “Adaptation, speciation and hybrid zones,” <i>Nature</i>, vol. 341. Nature Publishing Group, pp. 497–503, 1989.","apa":"Barton, N. H., &#38; Hewitt, G. (1989). Adaptation, speciation and hybrid zones. <i>Nature</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/341497a0\">https://doi.org/10.1038/341497a0</a>","ista":"Barton NH, Hewitt G. 1989. Adaptation, speciation and hybrid zones. Nature. 341, 497–503."},"main_file_link":[{"url":"https://www.nature.com/articles/341497a0"}],"status":"public","pmid":1,"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Many species are divided into a mosaic of genetically distinct populations, separated by narrow zones of hybridization. Studies of hybrid zones allow us to quantify the genetic differences responsible for speciation, to measure the diffusion of genes between diverging taxa, and to understand the spread of alternative adaptations."}],"title":"Adaptation, speciation and hybrid zones","_id":"3654"},{"issue":"7","publication_identifier":{"issn":["0002-9890"],"eissn":["1930-0972"]},"status":"public","citation":{"short":"H. Edelsbrunner, S. Skiena, American Mathematical Monthly 96 (1989) 614–618.","ieee":"H. Edelsbrunner and S. Skiena, “On the number of furthest neighbor pairs in a point set,” <i>American Mathematical Monthly</i>, vol. 96, no. 7. Mathematical Association of America, pp. 614–618, 1989.","ista":"Edelsbrunner H, Skiena S. 1989. On the number of furthest neighbor pairs in a point set. American Mathematical Monthly. 96(7), 614–618.","apa":"Edelsbrunner, H., &#38; Skiena, S. (1989). On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. Mathematical Association of America. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>","chicago":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>. Mathematical Association of America, 1989. <a href=\"https://doi.org/10.1080/00029890.1989.11972250\">https://doi.org/10.1080/00029890.1989.11972250</a>.","ama":"Edelsbrunner H, Skiena S. On the number of furthest neighbor pairs in a point set. <i>American Mathematical Monthly</i>. 1989;96(7):614-618. doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>","mla":"Edelsbrunner, Herbert, and Steven Skiena. “On the Number of Furthest Neighbor Pairs in a Point Set.” <i>American Mathematical Monthly</i>, vol. 96, no. 7, Mathematical Association of America, 1989, pp. 614–18, doi:<a href=\"https://doi.org/10.1080/00029890.1989.11972250\">10.1080/00029890.1989.11972250</a>."},"intvolume":"        96","main_file_link":[{"url":"http://www.jstor.org/stable/2325182 "}],"title":"On the number of furthest neighbor pairs in a point set","_id":"4079","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Research supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862","page":"614 - 618","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Skiena, Steven","first_name":"Steven","last_name":"Skiena"}],"day":"01","publication_status":"published","publist_id":"2042","date_created":"2018-12-11T12:06:49Z","year":"1989","language":[{"iso":"eng"}],"date_published":"1989-01-01T00:00:00Z","type":"journal_article","volume":96,"oa_version":"None","article_type":"original","publisher":"Mathematical Association of America","doi":"10.1080/00029890.1989.11972250","date_updated":"2022-02-11T12:59:01Z","publication":"American Mathematical Monthly","article_processing_charge":"No","quality_controlled":"1","extern":"1","month":"01"},{"status":"public","citation":{"chicago":"Edelsbrunner, Herbert, Nany Hasan, Raimund Seidel, and Xiao Shen. “Circles through Two Points That Always Enclose Many Points.” <i>Geometriae Dedicata</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF00181432\">https://doi.org/10.1007/BF00181432</a>.","ama":"Edelsbrunner H, Hasan N, Seidel R, Shen X. Circles through two points that always enclose many points. <i>Geometriae Dedicata</i>. 1989;32(1):1-12. doi:<a href=\"https://doi.org/10.1007/BF00181432\">10.1007/BF00181432</a>","mla":"Edelsbrunner, Herbert, et al. “Circles through Two Points That Always Enclose Many Points.” <i>Geometriae Dedicata</i>, vol. 32, no. 1, Springer, 1989, pp. 1–12, doi:<a href=\"https://doi.org/10.1007/BF00181432\">10.1007/BF00181432</a>.","ieee":"H. Edelsbrunner, N. Hasan, R. Seidel, and X. Shen, “Circles through two points that always enclose many points,” <i>Geometriae Dedicata</i>, vol. 32, no. 1. Springer, pp. 1–12, 1989.","short":"H. Edelsbrunner, N. Hasan, R. Seidel, X. Shen, Geometriae Dedicata 32 (1989) 1–12.","ista":"Edelsbrunner H, Hasan N, Seidel R, Shen X. 1989. Circles through two points that always enclose many points. Geometriae Dedicata. 32(1), 1–12.","apa":"Edelsbrunner, H., Hasan, N., Seidel, R., &#38; Shen, X. (1989). Circles through two points that always enclose many points. <i>Geometriae Dedicata</i>. Springer. <a href=\"https://doi.org/10.1007/BF00181432\">https://doi.org/10.1007/BF00181432</a>"},"intvolume":"        32","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF00181432"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"This paper proves that any set of n points in the plane contains two points such that any circle through those two points encloses at least n12−112+O(1)n47  points of the set. The main ingredients used in the proof of this result are edge counting formulas for k-order Voronoi diagrams and a lower bound on the minimum number of semispaces of size at most k."}],"title":"Circles through two points that always enclose many points","_id":"4080","acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565, by the second author has been partially supported by the Digital Equipment Corporation, by the fourth author has been partially supported by the Office of Naval Research under Grant N00014-86K-0416.","issue":"1","publication_identifier":{"issn":["0046-5755"],"eissn":["1572-9168"]},"scopus_import":"1","type":"journal_article","date_published":"1989-10-01T00:00:00Z","volume":32,"article_type":"original","oa_version":"None","article_processing_charge":"No","date_updated":"2022-02-14T09:55:28Z","publisher":"Springer","doi":"10.1007/BF00181432","publication":"Geometriae Dedicata","month":"10","quality_controlled":"1","extern":"1","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Hasan","first_name":"Nany","full_name":"Hasan, Nany"},{"last_name":"Seidel","first_name":"Raimund","full_name":"Seidel, Raimund"},{"full_name":"Shen, Xiao","first_name":"Xiao","last_name":"Shen"}],"page":"1 - 12","date_created":"2018-12-11T12:06:49Z","day":"01","publist_id":"2043","publication_status":"published","language":[{"iso":"eng"}],"year":"1989"},{"language":[{"iso":"eng"}],"year":"1989","author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"}],"page":"311 - 336","date_created":"2018-12-11T12:06:50Z","publication_status":"published","publist_id":"2038","day":"01","article_processing_charge":"No","publication":"Discrete & Computational Geometry","doi":"10.1007/BF02187733","publisher":"Springer","date_updated":"2022-02-10T15:53:48Z","month":"12","extern":"1","oa":1,"quality_controlled":"1","volume":4,"date_published":"1989-12-01T00:00:00Z","type":"journal_article","oa_version":"Published Version","article_type":"original","issue":"1","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"abstract":[{"text":"This paper studies applications of envelopes of piecewise linear functions to problems in computational geometry. Among these applications we find problems involving hidden line/surface elimination, motion planning, transversals of polytopes, and a new type of Voronoi diagram for clusters of points. All results are either combinatorial or computational in nature. They are based on the combinatorial analysis in two companion papers [PS] and [E2] and a divide-and-conquer algorithm for computing envelopes described in this paper.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4081","title":"The upper envelope of piecewise linear functions: Algorithms and applications","acknowledgement":"Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. Work by the third author has been supported by the Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, by grants from the Digital Equipment Corporation and the IBM Corporation, and by a research grant from NCRD, the Israeli National Council for Research and Development.","status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187733","open_access":"1"}],"citation":{"mla":"Edelsbrunner, Herbert, et al. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 311–36, doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>.","ama":"Edelsbrunner H, Guibas L, Sharir M. The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):311-336. doi:<a href=\"https://doi.org/10.1007/BF02187733\">10.1007/BF02187733</a>","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, and Micha Sharir. “The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>.","apa":"Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). The upper envelope of piecewise linear functions: Algorithms and applications. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187733\">https://doi.org/10.1007/BF02187733</a>","ista":"Edelsbrunner H, Guibas L, Sharir M. 1989. The upper envelope of piecewise linear functions: Algorithms and applications. Discrete &#38; Computational Geometry. 4(1), 311–336.","short":"H. Edelsbrunner, L. Guibas, M. Sharir, Discrete &#38; Computational Geometry 4 (1989) 311–336.","ieee":"H. Edelsbrunner, L. Guibas, and M. Sharir, “The upper envelope of piecewise linear functions: Algorithms and applications,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 311–336, 1989."},"intvolume":"         4"},{"publication_identifier":{"eissn":["1090-2724"],"issn":["0022-0000"]},"issue":"1","scopus_import":"1","citation":{"mla":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1, Elsevier, 1989, pp. 165–94, doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>.","ama":"Edelsbrunner H, Guibas L. Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. 1989;38(1):165-194. doi:<a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">10.1016/0022-0000(89)90038-X</a>","chicago":"Edelsbrunner, Herbert, and Leonidas Guibas. “Topologically Sweeping an Arrangement.” <i>Journal of Computer and System Sciences</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>.","apa":"Edelsbrunner, H., &#38; Guibas, L. (1989). Topologically sweeping an arrangement. <i>Journal of Computer and System Sciences</i>. Elsevier. <a href=\"https://doi.org/10.1016/0022-0000(89)90038-X\">https://doi.org/10.1016/0022-0000(89)90038-X</a>","ista":"Edelsbrunner H, Guibas L. 1989. Topologically sweeping an arrangement. Journal of Computer and System Sciences. 38(1), 165–194.","short":"H. Edelsbrunner, L. Guibas, Journal of Computer and System Sciences 38 (1989) 165–194.","ieee":"H. Edelsbrunner and L. Guibas, “Topologically sweeping an arrangement,” <i>Journal of Computer and System Sciences</i>, vol. 38, no. 1. Elsevier, pp. 165–194, 1989."},"intvolume":"        38","main_file_link":[{"open_access":"1","url":"https://www.sciencedirect.com/science/article/pii/002200008990038X?via%3Dihub"}],"status":"public","acknowledgement":"he authors wish to thank Raimund Seidel for suggesting the argument that we used to prove Theorem 3.1, Harald Rosenberger who implemented the topological sweep and compared it with a straight line sweep, the students who took the Stanford 1985 analysis of algorithms qualifying examination and suffered through a version of this problem, and finally Lyle Ramshaw and Cynthia Hibbard for their detailed reading and comments on the manuscript. The constructive criticism of an anonymous referee is also appreciated.","title":"Topologically sweeping an arrangement","_id":"4082","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Sweeping a collection of figures in the Euclidean plane with a straight line is one of the novel algorithmic paradigms that have emerged in the field of computational geometry. In this paper we demonstrate the advantages of sweeping with a topological line that is not necessarily straight. We show how an arrangement of n lines in the plane can be swept over in O(n2) time and O(n) space by a such a line. In the process each element, i.e., vertex, edge, or region, is visited once in a consistent ordering. Our technique makes use of novel data structures which exhibit interesting amortized complexity behavior; the result is an algorithm that improves upon all its predecessors either in the space or the time bounds, as well as being eminently practical. Numerous applications of the technique to problems in computational geometry are given—many through the use of duality transforms. Examples include solving visibility problems, detecting degeneracies in configurations, computing the extremal shadows of convex polytopes, and others. Even though our basic technique solves a planar problem, its applications include several problems in higher dimensions.","lang":"eng"}],"day":"01","publist_id":"2039","publication_status":"published","date_created":"2018-12-11T12:06:50Z","page":"165 - 194","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","full_name":"Guibas, Leonidas","first_name":"Leonidas"}],"year":"1989","language":[{"iso":"eng"}],"article_type":"original","oa_version":"Published Version","type":"journal_article","date_published":"1989-02-01T00:00:00Z","volume":38,"oa":1,"quality_controlled":"1","extern":"1","month":"02","date_updated":"2022-02-10T16:06:05Z","publisher":"Elsevier","doi":"10.1016/0022-0000(89)90038-X","publication":"Journal of Computer and System Sciences","article_processing_charge":"No"},{"year":"1989","language":[{"iso":"eng"}],"page":"371 - 384","author":[{"full_name":"Yao, F.","first_name":"F.","last_name":"Yao"},{"last_name":"Dobkin","first_name":"David","full_name":"Dobkin, David"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Paterson","first_name":"Michael","full_name":"Paterson, Michael"}],"day":"01","publist_id":"2040","publication_status":"published","date_created":"2018-12-11T12:06:50Z","doi":"10.1137/0218025","publisher":"SIAM","date_updated":"2022-02-11T07:55:48Z","publication":"SIAM Journal on Computing","article_processing_charge":"No","oa":1,"quality_controlled":"1","extern":"1","month":"04","type":"journal_article","date_published":"1989-04-01T00:00:00Z","volume":18,"oa_version":"Published Version","article_type":"original","scopus_import":"1","issue":"2","publication_identifier":{"eissn":["1095-7111"],"issn":["0097-5397"]},"title":"Partitioning space for range queries","_id":"4083","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"It is shown that, given a set S of n points in $R^3 $, one can always find three planes that form an eight-partition of S, that is, a partition where at most ${n / 8}$ points of S lie in each of the eight open regions. This theorem is used to define a data structure, called an octant tree, for representing any point set in $R^3 $. An octant tree for n points occupies $O(n)$ space and can be constructed in polynomial time. With this data structure and its refinements, efficient solutions to various range query problems in two and three dimensions can be obtained, including (1) half-space queries: find all points of S that lie to one side of any given plane; (2) polyhedron queries: find all points that lie inside (outside) any given polyhedron; and (3) circle queries in $R^2 $: for a planar set S, find all points that lie inside (outside) any given circle. The retrieval time for all these queries is $T(n) = O(n^\\alpha + m)$, where $\\alpha = 0.8988$ (or 0.8471 in case (3)), and m is the size of the output. This performance is the best currently known for linear-space data structures that can be deterministically constructed in polynomial time.","lang":"eng"}],"status":"public","intvolume":"        18","citation":{"ista":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. 1989. Partitioning space for range queries. SIAM Journal on Computing. 18(2), 371–384.","apa":"Yao, F., Dobkin, D., Edelsbrunner, H., &#38; Paterson, M. (1989). Partitioning space for range queries. <i>SIAM Journal on Computing</i>. SIAM. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>","short":"F. Yao, D. Dobkin, H. Edelsbrunner, M. Paterson, SIAM Journal on Computing 18 (1989) 371–384.","ieee":"F. Yao, D. Dobkin, H. Edelsbrunner, and M. Paterson, “Partitioning space for range queries,” <i>SIAM Journal on Computing</i>, vol. 18, no. 2. SIAM, pp. 371–384, 1989.","ama":"Yao F, Dobkin D, Edelsbrunner H, Paterson M. Partitioning space for range queries. <i>SIAM Journal on Computing</i>. 1989;18(2):371-384. doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>","mla":"Yao, F., et al. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>, vol. 18, no. 2, SIAM, 1989, pp. 371–84, doi:<a href=\"https://doi.org/10.1137/0218025\">10.1137/0218025</a>.","chicago":"Yao, F., David Dobkin, Herbert Edelsbrunner, and Michael Paterson. “Partitioning Space for Range Queries.” <i>SIAM Journal on Computing</i>. SIAM, 1989. <a href=\"https://doi.org/10.1137/0218025\">https://doi.org/10.1137/0218025</a>."},"main_file_link":[{"url":"https://epubs.siam.org/doi/10.1137/0218025","open_access":"1"}]},{"extern":"1","quality_controlled":"1","oa":1,"month":"08","publication":"Theoretical Computer Science","date_updated":"2022-02-11T11:15:43Z","publisher":"Elsevier","doi":"10.1016/0304-3975(89)90133-3","article_processing_charge":"No","oa_version":"Published Version","article_type":"original","volume":66,"type":"journal_article","date_published":"1989-08-01T00:00:00Z","language":[{"iso":"eng"}],"year":"1989","publication_status":"published","publist_id":"2041","day":"01","date_created":"2018-12-11T12:06:51Z","page":"157 - 180","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"first_name":"Günter","full_name":"Rote, Günter","last_name":"Rote"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"}],"_id":"4084","title":"Testing the necklace condition for shortest tours and optimal factors in the plane","abstract":[{"lang":"eng","text":"A tour  of a finite set P of points is a necklace-tour if there are disks with the points in P as centers such that two disks intersect if and only if their centers are adjacent in . It has been observed by Sanders that a necklace-tour is an optimal traveling salesman tour.\r\n\r\nIn this paper, we present an algorithm that either reports that no necklace-tour exists or outputs a necklace-tour of a given set of n points in O(n2 log n) time. If a tour is given, then we can test in O(n2) time whether or not this tour is a necklace-tour. Both algorithms can be generalized to ƒ-factors of point sets in the plane. The complexity results rely on a combinatorial analysis of certain intersection graphs of disks defined for finite sets of points in the plane."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0304397589901333?via%3Dihub","open_access":"1"}],"intvolume":"        66","citation":{"chicago":"Edelsbrunner, Herbert, Günter Rote, and Emo Welzl. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>. Elsevier, 1989. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>.","mla":"Edelsbrunner, Herbert, et al. “Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.” <i>Theoretical Computer Science</i>, vol. 66, no. 2, Elsevier, 1989, pp. 157–80, doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>.","ama":"Edelsbrunner H, Rote G, Welzl E. Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. 1989;66(2):157-180. doi:<a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">10.1016/0304-3975(89)90133-3</a>","ieee":"H. Edelsbrunner, G. Rote, and E. Welzl, “Testing the necklace condition for shortest tours and optimal factors in the plane,” <i>Theoretical Computer Science</i>, vol. 66, no. 2. Elsevier, pp. 157–180, 1989.","short":"H. Edelsbrunner, G. Rote, E. Welzl, Theoretical Computer Science 66 (1989) 157–180.","apa":"Edelsbrunner, H., Rote, G., &#38; Welzl, E. (1989). Testing the necklace condition for shortest tours and optimal factors in the plane. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/0304-3975(89)90133-3\">https://doi.org/10.1016/0304-3975(89)90133-3</a>","ista":"Edelsbrunner H, Rote G, Welzl E. 1989. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoretical Computer Science. 66(2), 157–180."},"status":"public","scopus_import":"1","publication_identifier":{"issn":["0304-3975"],"eissn":["1879-2294"]},"issue":"2"},{"language":[{"iso":"eng"}],"year":"1989","scopus_import":"1","conference":{"end_date":"1989-06-07","location":"Saarbruchen, Germany","name":"SCG: Symposium on Computational Geometry","start_date":"1989-06-05"},"page":"145 - 151","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}],"day":"01","publist_id":"2033","publication_status":"published","date_created":"2018-12-11T12:06:51Z","publication_identifier":{"isbn":["978-0-89791-318-8"]},"publisher":"ACM","doi":"10.1145/73833.73850","date_updated":"2022-02-10T10:56:49Z","title":"An acyclicity theorem for cell complexes in d dimension","_id":"4085","publication":"Proceedings of the 5th annual symposium on Computational geometry","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Let C be a cell complex in d-dimensional Euclidean space whose faces are obtained by orthogonal projection of the faces of a convex polytope in d + 1 dimensions. For example, the Delaunay triangulation of a finite point set is such a cell complex. This paper shows that the in_front/behind relation defined for the faces of C with respect to any fixed viewpoint x is acyclic. This result has applications to hidden line/surface removal and other problems in computational geometry.","lang":"eng"}],"quality_controlled":"1","extern":"1","month":"06","status":"public","type":"conference","date_published":"1989-06-01T00:00:00Z","citation":{"apa":"Edelsbrunner, H. (1989). An acyclicity theorem for cell complexes in d dimension. In <i>Proceedings of the 5th annual symposium on Computational geometry</i> (pp. 145–151). Saarbruchen, Germany: ACM. <a href=\"https://doi.org/10.1145/73833.73850\">https://doi.org/10.1145/73833.73850</a>","ista":"Edelsbrunner H. 1989. An acyclicity theorem for cell complexes in d dimension. Proceedings of the 5th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 145–151.","short":"H. Edelsbrunner, in:, Proceedings of the 5th Annual Symposium on Computational Geometry, ACM, 1989, pp. 145–151.","ieee":"H. Edelsbrunner, “An acyclicity theorem for cell complexes in d dimension,” in <i>Proceedings of the 5th annual symposium on Computational geometry</i>, Saarbruchen, Germany, 1989, pp. 145–151.","mla":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>, ACM, 1989, pp. 145–51, doi:<a href=\"https://doi.org/10.1145/73833.73850\">10.1145/73833.73850</a>.","ama":"Edelsbrunner H. An acyclicity theorem for cell complexes in d dimension. In: <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>. ACM; 1989:145-151. doi:<a href=\"https://doi.org/10.1145/73833.73850\">10.1145/73833.73850</a>","chicago":"Edelsbrunner, Herbert. “An Acyclicity Theorem for Cell Complexes in d Dimension.” In <i>Proceedings of the 5th Annual Symposium on Computational Geometry</i>, 145–51. ACM, 1989. <a href=\"https://doi.org/10.1145/73833.73850\">https://doi.org/10.1145/73833.73850</a>."},"main_file_link":[{"url":"https://dl.acm.org/doi/10.1145/73833.73850"}],"oa_version":"None"},{"oa_version":"Published Version","article_type":"original","volume":4,"type":"journal_article","date_published":"1989-11-01T00:00:00Z","month":"11","extern":"1","quality_controlled":"1","oa":1,"article_processing_charge":"No","publication":"Discrete & Computational Geometry","publisher":"Springer","doi":"10.1007/BF02187734","date_updated":"2022-02-10T11:08:12Z","date_created":"2018-12-11T12:06:51Z","publist_id":"2034","publication_status":"published","day":"01","author":[{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"}],"page":"337 - 343","year":"1989","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187734","open_access":"1"}],"intvolume":"         4","citation":{"ama":"Edelsbrunner H. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. 1989;4(4):337-343. doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>","mla":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4, Springer, 1989, pp. 337–43, doi:<a href=\"https://doi.org/10.1007/BF02187734\">10.1007/BF02187734</a>.","chicago":"Edelsbrunner, Herbert. “The Upper Envelope of Piecewise Linear Functions: Tight Bounds on the Number of Faces .” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>.","ista":"Edelsbrunner H. 1989. The upper envelope of piecewise linear functions: Tight bounds on the number of faces . Discrete &#38; Computational Geometry. 4(4), 337–343.","apa":"Edelsbrunner, H. (1989). The upper envelope of piecewise linear functions: Tight bounds on the number of faces . <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187734\">https://doi.org/10.1007/BF02187734</a>","ieee":"H. Edelsbrunner, “The upper envelope of piecewise linear functions: Tight bounds on the number of faces ,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 4. Springer, pp. 337–343, 1989.","short":"H. Edelsbrunner, Discrete &#38; Computational Geometry 4 (1989) 337–343."},"status":"public","acknowledgement":"This work was supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565. Research on the presented result was partially carried out while the author worked for the IBM T. J. Watson Research Center at Yorktown Height, New York, USA. \r\n","abstract":[{"text":"This note proves that the maximum number of faces (of any dimension) of the upper envelope of a set ofn possibly intersectingd-simplices ind+1 dimensions is (n d (n)). This is an extension of a result of Pach and Sharir [PS] who prove the same bound for the number ofd-dimensional faces of the upper envelope.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4086","title":"The upper envelope of piecewise linear functions: Tight bounds on the number of faces ","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"issue":"4","scopus_import":"1"},{"main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/3-540-51084-2_31"}],"citation":{"ista":"Edelsbrunner H, Preparata F, West D. 1989. Tetrahedrizing point sets in three dimensions.  International Symposium on Symbolic and Algebraic Computation. ISSAC: International Symposium on Symbolic and Algebraic Computation, LNCS, vol. 358, 315–331.","apa":"Edelsbrunner, H., Preparata, F., &#38; West, D. (1989). Tetrahedrizing point sets in three dimensions. In <i> International Symposium on Symbolic and Algebraic Computation</i> (Vol. 358, pp. 315–331). Rome, Italy: Springer. <a href=\"https://doi.org/10.1007/3-540-51084-2_31\">https://doi.org/10.1007/3-540-51084-2_31</a>","short":"H. Edelsbrunner, F. Preparata, D. West, in:,  International Symposium on Symbolic and Algebraic Computation, Springer, 1989, pp. 315–331.","ieee":"H. Edelsbrunner, F. Preparata, and D. West, “Tetrahedrizing point sets in three dimensions,” in <i> International Symposium on Symbolic and Algebraic Computation</i>, Rome, Italy, 1989, vol. 358, pp. 315–331.","ama":"Edelsbrunner H, Preparata F, West D. Tetrahedrizing point sets in three dimensions. In: <i> International Symposium on Symbolic and Algebraic Computation</i>. Vol 358. Springer; 1989:315-331. doi:<a href=\"https://doi.org/10.1007/3-540-51084-2_31\">10.1007/3-540-51084-2_31</a>","mla":"Edelsbrunner, Herbert, et al. “Tetrahedrizing Point Sets in Three Dimensions.” <i> International Symposium on Symbolic and Algebraic Computation</i>, vol. 358, Springer, 1989, pp. 315–31, doi:<a href=\"https://doi.org/10.1007/3-540-51084-2_31\">10.1007/3-540-51084-2_31</a>.","chicago":"Edelsbrunner, Herbert, Franco Preparata, and Douglas West. “Tetrahedrizing Point Sets in Three Dimensions.” In <i> International Symposium on Symbolic and Algebraic Computation</i>, 358:315–31. Springer, 1989. <a href=\"https://doi.org/10.1007/3-540-51084-2_31\">https://doi.org/10.1007/3-540-51084-2_31</a>."},"intvolume":"       358","status":"public","acknowledgement":"Research of the first author is supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862, the second author is supported by NSF Grant ECS 84-10902, and research of the third author is supported in part by ONR Grant N00014-85K0570 and by NSF Grant DMS 8504","_id":"4087","title":"Tetrahedrizing point sets in three dimensions","abstract":[{"lang":"eng","text":"This paper offers combinatorial results on extremum problems concerning the number of tetrahedra in a tetrahedrization of n points in general position in three dimensions, i.e. such that no four points are coplanar. It also presents an algorithm that in O(nlog n) time constructs a tetrahedrization of a set of n points consisting of at most 3n–11 tetrahedra."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","scopus_import":"1","oa_version":"None","volume":358,"date_published":"1989-09-20T00:00:00Z","type":"conference","extern":"1","quality_controlled":"1","month":"09","publication":" International Symposium on Symbolic and Algebraic Computation","publisher":"Springer","doi":"10.1007/3-540-51084-2_31","date_updated":"2022-02-10T13:27:41Z","article_processing_charge":"No","publication_status":"published","publist_id":"2035","day":"20","date_created":"2018-12-11T12:06:52Z","page":"315 - 331","alternative_title":["LNCS"],"conference":{"start_date":"1988-07-04","name":"ISSAC: International Symposium on Symbolic and Algebraic Computation","location":"Rome, Italy","end_date":"1988-07-08"},"author":[{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"last_name":"Preparata","first_name":"Franco","full_name":"Preparata, Franco"},{"last_name":"West","first_name":"Douglas","full_name":"West, Douglas"}],"language":[{"iso":"eng"}],"year":"1989"},{"volume":4,"date_published":"1989-12-01T00:00:00Z","type":"journal_article","oa_version":"Published Version","article_type":"original","article_processing_charge":"No","publication":"Discrete & Computational Geometry","publisher":"Springer","doi":"10.1007/BF02187742","date_updated":"2022-02-10T15:03:48Z","month":"12","extern":"1","quality_controlled":"1","oa":1,"author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"last_name":"Hershberger","full_name":"Hershberger, John","first_name":"John"},{"first_name":"Raimund","full_name":"Seidel, Raimund","last_name":"Seidel"},{"first_name":"Micha","full_name":"Sharir, Micha","last_name":"Sharir"},{"first_name":"Jack","full_name":"Snoeyink, Jack","last_name":"Snoeyink"},{"last_name":"Welzl","full_name":"Welzl, Emo","first_name":"Emo"}],"page":"433 - 466","date_created":"2018-12-11T12:06:52Z","publist_id":"2036","publication_status":"published","day":"01","year":"1989","language":[{"iso":"eng"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187742"}],"citation":{"chicago":"Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187742\">https://doi.org/10.1007/BF02187742</a>.","mla":"Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:<a href=\"https://doi.org/10.1007/BF02187742\">10.1007/BF02187742</a>.","ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):433-466. doi:<a href=\"https://doi.org/10.1007/BF02187742\">10.1007/BF02187742</a>","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete &#38; Computational Geometry 4 (1989) 433–466.","ieee":"H. Edelsbrunner <i>et al.</i>, “Implicitly representing arrangements of lines or segments,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 433–466, 1989.","apa":"Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., &#38; Welzl, E. (1989). Implicitly representing arrangements of lines or segments. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187742\">https://doi.org/10.1007/BF02187742</a>","ista":"Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete &#38; Computational Geometry. 4(1), 433–466."},"intvolume":"         4","abstract":[{"lang":"eng","text":"Anarrangement ofn lines (or line segments) in the plane is the partition of the plane defined by these objects. Such an arrangement consists ofO(n 2) regions, calledfaces. In this paper we study the problem of calculating and storing arrangementsimplicitly, using subquadratic space and preprocessing, so that, given any query pointp, we can calculate efficiently the face containingp. First, we consider the case of lines and show that with (n) space1 and (n 3/2) preprocessing time, we can answer face queries in (n)+O(K) time, whereK is the output size. (The query time is achieved with high probability.) In the process, we solve three interesting subproblems: (1) given a set ofn points, find a straight-edge spanning tree of these points such that any line intersects only a few edges of the tree, (2) given a simple polygonal path , form a data structure from which we can find the convex hull of any subpath of quickly, and (3) given a set of points, organize them so that the convex hull of their subset lying above a query line can be found quickly. Second, using random sampling, we give a tradeoff between increasing space and decreasing query time. Third, we extend our structure to report faces in an arrangement of line segments in (n 1/3)+O(K) time, given(n 4/3) space and (n 5/3) preprocessing time. Lastly, we note that our techniques allow us to computem faces in an arrangement ofn lines in time (m 2/3 n 2/3+n), which is nearly optimal."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","_id":"4088","title":"Implicitly representing arrangements of lines or segments","acknowledgement":"The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fifth author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. The sixth author was supported in part by a National Science Foundation Graduate Fellowship. This work was begun while the non-DEC authors were visiting at the DEC Systems Research Center.","issue":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"scopus_import":"1"},{"publisher":"Springer","date_updated":"2022-02-10T15:40:04Z","doi":"10.1007/BF02187745","publication":"Discrete & Computational Geometry","article_processing_charge":"No","quality_controlled":"1","oa":1,"extern":"1","month":"12","type":"journal_article","date_published":"1989-12-01T00:00:00Z","volume":4,"oa_version":"Published Version","article_type":"original","language":[{"iso":"eng"}],"year":"1989","page":"523 - 539","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Guibas","full_name":"Guibas, Leonidas","first_name":"Leonidas"},{"last_name":"Hershberger","first_name":"John","full_name":"Hershberger, John"},{"last_name":"Pach","first_name":"János","full_name":"Pach, János"},{"last_name":"Pollack","first_name":"Richard","full_name":"Pollack, Richard"},{"last_name":"Seidel","full_name":"Seidel, Raimund","first_name":"Raimund"},{"first_name":"Micha","full_name":"Sharir, Micha","last_name":"Sharir"},{"full_name":"Snoeyink, Jack","first_name":"Jack","last_name":"Snoeyink"}],"day":"01","publist_id":"2037","publication_status":"published","date_created":"2018-12-11T12:06:52Z","title":"On arrangements of Jordan arcs with three intersections per pair","_id":"4089","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"lang":"eng","text":"Motivated by a number of motion-planning questions, we investigate in this paper some general topological and combinatorial properties of the boundary of the union ofn regions bounded by Jordan curves in the plane. We show that, under some fairly weak conditions, a simply connected surface can be constructed that exactly covers this union and whose boundary has combinatorial complexity that is nearly linear, even though the covered region can have quadratic complexity. In the case where our regions are delimited by Jordan acrs in the upper halfplane starting and ending on thex-axis such that any pair of arcs intersect in at most three points, we prove that the total number of subarcs that appear on the boundary of the union is only (n(n)), where(n) is the extremely slowly growing functional inverse of Ackermann's function."}],"acknowledgement":"The first author is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and National Science Foundation Grant CCR-8714565. Work on this paper by the fourth and seventh authors has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation. The seventh author in addition wishes to acknowledge support by a research grant from the NCRD—the Israeli National Council for Research and Development. The fifth author would like to acknowledge support in part by NSF grant DMS-8501947. Finally, the eighth author was supported in part by a National Science Foundation Graduate Fellowship.","status":"public","citation":{"chicago":"Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, János Pach, Richard Pollack, Raimund Seidel, Micha Sharir, and Jack Snoeyink. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187745\">https://doi.org/10.1007/BF02187745</a>.","mla":"Edelsbrunner, Herbert, et al. “On Arrangements of Jordan Arcs with Three Intersections per Pair.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 523–39, doi:<a href=\"https://doi.org/10.1007/BF02187745\">10.1007/BF02187745</a>.","ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. On arrangements of Jordan arcs with three intersections per pair. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):523-539. doi:<a href=\"https://doi.org/10.1007/BF02187745\">10.1007/BF02187745</a>","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, J. Pach, R. Pollack, R. Seidel, M. Sharir, J. Snoeyink, Discrete &#38; Computational Geometry 4 (1989) 523–539.","ieee":"H. Edelsbrunner <i>et al.</i>, “On arrangements of Jordan arcs with three intersections per pair,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 523–539, 1989.","apa":"Edelsbrunner, H., Guibas, L., Hershberger, J., Pach, J., Pollack, R., Seidel, R., … Snoeyink, J. (1989). On arrangements of Jordan arcs with three intersections per pair. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187745\">https://doi.org/10.1007/BF02187745</a>","ista":"Edelsbrunner H, Guibas L, Hershberger J, Pach J, Pollack R, Seidel R, Sharir M, Snoeyink J. 1989. On arrangements of Jordan arcs with three intersections per pair. Discrete &#38; Computational Geometry. 4(1), 523–539."},"intvolume":"         4","main_file_link":[{"open_access":"1","url":"https://link.springer.com/article/10.1007/BF02187745"}],"scopus_import":"1","issue":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]}},{"scopus_import":"1","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"A singly exponential stratification scheme for real semi-algebraic varieties and its applications","_id":"4092","acknowledgement":"The support of the Digital Systems Research center and the Digital Paris Research laboratory, where much of this research was carried out, are gratefully acknowledged. Work on this paper by Bernard Chazelle has been supported by NSF Grant CCI~-87-00917. Work on this paper by Herbert Edelsbrunner has been supported by NSF Grant CCR-87-14565. Work on this paper by Micha Sharir has been supported by ONR Grant N00014-87-K-0129, by NSF Grant DCP~-83-20085, and by grants from the U.S.-Israeli Binational Science Foundation, the NCRD - the Israeli National Council for Research and Development, and the EMET Fund of the Israeli Academy of Sciences. ","status":"public","citation":{"short":"B. Chazelle, H. Edelsbrunner, L. Guibas, M. Sharir, in:, 16th International Colloquium on Automata, Languages, and Programming, Springer, 1989, pp. 179–193.","ieee":"B. Chazelle, H. Edelsbrunner, L. Guibas, and M. Sharir, “A singly exponential stratification scheme for real semi-algebraic varieties and its applications,” in <i>16th International Colloquium on Automata, Languages, and Programming</i>, Stresa, Italy, 1989, vol. 372, pp. 179–193.","ista":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. 1989. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. 16th International Colloquium on Automata, Languages, and Programming. ICALP: International Colloquium on Automata, Languages, and Programming, LNCS, vol. 372, 179–193.","apa":"Chazelle, B., Edelsbrunner, H., Guibas, L., &#38; Sharir, M. (1989). A singly exponential stratification scheme for real semi-algebraic varieties and its applications. In <i>16th International Colloquium on Automata, Languages, and Programming</i> (Vol. 372, pp. 179–193). Stresa, Italy: Springer. <a href=\"https://doi.org/10.1007/BFb0035760\">https://doi.org/10.1007/BFb0035760</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, Leonidas Guibas, and Micha Sharir. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” In <i>16th International Colloquium on Automata, Languages, and Programming</i>, 372:179–93. Springer, 1989. <a href=\"https://doi.org/10.1007/BFb0035760\">https://doi.org/10.1007/BFb0035760</a>.","ama":"Chazelle B, Edelsbrunner H, Guibas L, Sharir M. A singly exponential stratification scheme for real semi-algebraic varieties and its applications. In: <i>16th International Colloquium on Automata, Languages, and Programming</i>. Vol 372. Springer; 1989:179-193. doi:<a href=\"https://doi.org/10.1007/BFb0035760\">10.1007/BFb0035760</a>","mla":"Chazelle, Bernard, et al. “A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and Its Applications.” <i>16th International Colloquium on Automata, Languages, and Programming</i>, vol. 372, Springer, 1989, pp. 179–93, doi:<a href=\"https://doi.org/10.1007/BFb0035760\">10.1007/BFb0035760</a>."},"intvolume":"       372","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/BFb0035760"}],"language":[{"iso":"eng"}],"year":"1989","author":[{"last_name":"Chazelle","first_name":"Bernard","full_name":"Chazelle, Bernard"},{"first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"last_name":"Guibas","first_name":"Leonidas","full_name":"Guibas, Leonidas"},{"last_name":"Sharir","full_name":"Sharir, Micha","first_name":"Micha"}],"conference":{"end_date":"1989-07-15","location":"Stresa, Italy","name":"ICALP: International Colloquium on Automata, Languages, and Programming","start_date":"1989-07-11"},"alternative_title":["LNCS"],"page":"179 - 193","date_created":"2018-12-11T12:06:53Z","day":"24","publication_status":"published","publist_id":"2031","article_processing_charge":"No","date_updated":"2022-02-10T10:06:23Z","publisher":"Springer","doi":"10.1007/BFb0035760","publication":"16th International Colloquium on Automata, Languages, and Programming","month":"07","quality_controlled":"1","extern":"1","type":"conference","date_published":"1989-07-24T00:00:00Z","volume":372,"oa_version":"None"},{"status":"public","main_file_link":[{"url":"https://link.springer.com/article/10.1007/BF02187720"}],"intvolume":"         4","citation":{"mla":"Chazelle, Bernard, et al. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1, Springer, 1989, pp. 139–81, doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>.","ama":"Chazelle B, Edelsbrunner H, Guibas L. The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. 1989;4(1):139-181. doi:<a href=\"https://doi.org/10.1007/BF02187720\">10.1007/BF02187720</a>","chicago":"Chazelle, Bernard, Herbert Edelsbrunner, and Leonidas Guibas. “The Complexity of Cutting Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer, 1989. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>.","apa":"Chazelle, B., Edelsbrunner, H., &#38; Guibas, L. (1989). The complexity of cutting complexes. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/BF02187720\">https://doi.org/10.1007/BF02187720</a>","ista":"Chazelle B, Edelsbrunner H, Guibas L. 1989. The complexity of cutting complexes. Discrete &#38; Computational Geometry. 4(1), 139–181.","ieee":"B. Chazelle, H. Edelsbrunner, and L. Guibas, “The complexity of cutting complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 4, no. 1. Springer, pp. 139–181, 1989.","short":"B. Chazelle, H. Edelsbrunner, L. Guibas, Discrete &#38; Computational Geometry 4 (1989) 139–181."},"_id":"4093","title":"The complexity of cutting complexes","abstract":[{"lang":"eng","text":"This paper investigates the combinatorial and computational aspects of certain extremal geometric problems in two and three dimensions. Specifically, we examine the problem of intersecting a convex subdivision with a line in order to maximize the number of intersections. A similar problem is to maximize the number of intersected facets in a cross-section of a three-dimensional convex polytope. Related problems concern maximum chains in certain families of posets defined over the regions of a convex subdivision. In most cases we are able to prove sharp bounds on the asymptotic behavior of the corresponding extremal functions. We also describe polynomial algorithms for all the problems discussed."}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","acknowledgement":"Bernard Chazelle wishes to acknowledge the National Science Foundation for supporting this research in part under Grant No. MCS83-03925. Herbert Edelsbrunner is pleased to acknowledge the support of Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862. We wish to thank J. Pach and E. Szemeredi for valuable discussions on several\r\nof the problems studied in this paper.","issue":"1","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"volume":4,"date_published":"1989-03-01T00:00:00Z","type":"journal_article","oa_version":"None","publication":"Discrete & Computational Geometry","publisher":"Springer","date_updated":"2022-02-10T10:25:57Z","doi":"10.1007/BF02187720","article_processing_charge":"No","extern":"1","quality_controlled":"1","month":"03","page":"139 - 181","author":[{"last_name":"Chazelle","full_name":"Chazelle, Bernard","first_name":"Bernard"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"last_name":"Guibas","full_name":"Guibas, Leonidas","first_name":"Leonidas"}],"publist_id":"2032","publication_status":"published","day":"01","date_created":"2018-12-11T12:06:54Z","year":"1989","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0014-3820"],"eissn":["1558-5646"]},"issue":"7","citation":{"mla":"Slatkin, Montgomery, and Nicholas H. Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 43, no. 7, Wiley-Blackwell, 1989, pp. 1349–68, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">10.1111/j.1558-5646.1989.tb02587.x </a>.","ama":"Slatkin M, Barton NH. A comparison of three methods for estimating average levels of gene flow. <i>Evolution; International Journal of Organic Evolution</i>. 1989;43(7):1349-1368. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">10.1111/j.1558-5646.1989.tb02587.x </a>","chicago":"Slatkin, Montgomery, and Nicholas H Barton. “A Comparison of Three Methods for Estimating Average Levels of Gene Flow.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 1989. <a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">https://doi.org/10.1111/j.1558-5646.1989.tb02587.x </a>.","apa":"Slatkin, M., &#38; Barton, N. H. (1989). A comparison of three methods for estimating average levels of gene flow. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.1989.tb02587.x \">https://doi.org/10.1111/j.1558-5646.1989.tb02587.x </a>","ista":"Slatkin M, Barton NH. 1989. A comparison of three methods for estimating average levels of gene flow. Evolution; International Journal of Organic Evolution. 43(7), 1349–1368.","short":"M. Slatkin, N.H. Barton, Evolution; International Journal of Organic Evolution 43 (1989) 1349–1368.","ieee":"M. Slatkin and N. H. Barton, “A comparison of three methods for estimating average levels of gene flow,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 43, no. 7. Wiley-Blackwell, pp. 1349–1368, 1989."},"intvolume":"        43","main_file_link":[{"url":"http://www.jstor.org/stable/2409452"}],"status":"public","acknowledgement":"This research has been supported in partv by grant 85-00258 from the National Science Foundation and by grants GR/C/9 1529 and GR/E/08507 from the Science and Engineering Research Council. We thank C. C. Cockerham and B. S. Weir for helpful discussions of this topic, C. Wehrhahn for bringing his method to our attention and for providing us with a copy of his program for estimating Nm, and J. Coyne, M. Nei, B. S. Weir, and an anonymous referee for comments on an earlier draft of this paper.","pmid":1,"title":"A comparison of three methods for estimating average levels of gene flow","_id":"4309","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"Three methods for estimating the average level of gene flow in natural population are discussed and compared. The three methods are FST, rare alleles, and maximum likelihood. All three methods yield estimates of the combination of parameters (the number of migrants [Nm] in a demic model or the neighborhood size [4πDσ2] in a continuum model) that determines the relative importance of gene flow and genetic drift. We review the theory underlying these methods and derive new analytic results for the expectation of FST in stepping-stone and continuum models when small sets of samples are taken. We also compare the effectiveness of the different methods using a variety of simulated data. We found that the FST and rare-alleles methods yield comparable estimates under a wide variety of conditions when the population being sampled is demographically stable. They are roughly equally sensitive to selection and to variation in population structure, and they approach their equilibrium values at approximately the same rate. We found that two different maximum-likelihood methods tend to yield biased estimates when relatively small numbers of locations are sampled but more accurate estimates when larger numbers are sampled. Our conclusion is that, although FST and rare-alleles methods are expected to be equally effective in analyzing ideal data, practical problems in estimating the frequencies of rare alleles in electrophoretic studies suggest that FST is likely to be more useful under realistic conditions.","lang":"eng"}],"day":"01","publication_status":"published","publist_id":"1751","date_created":"2018-12-11T12:08:10Z","page":"1349 - 1368","author":[{"last_name":"Slatkin","full_name":"Slatkin, Montgomery","first_name":"Montgomery"},{"orcid":"0000-0002-8548-5240","last_name":"Barton","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"year":"1989","language":[{"iso":"eng"}],"oa_version":"None","article_type":"original","external_id":{"pmid":["28564250 "]},"date_published":"1989-11-01T00:00:00Z","type":"journal_article","volume":43,"quality_controlled":"1","extern":"1","month":"11","date_updated":"2022-02-10T09:44:53Z","publisher":"Wiley-Blackwell","doi":"10.1111/j.1558-5646.1989.tb02587.x ","publication":"Evolution; International Journal of Organic Evolution","article_processing_charge":"No"},{"volume":23,"type":"journal_article","date_published":"1989-01-01T00:00:00Z","status":"public","oa_version":"None","article_type":"original","main_file_link":[{"url":"https://www.annualreviews.org/doi/10.1146/annurev.ge.23.120189.002005"}],"citation":{"ieee":"N. H. Barton and M. Turelli, “Evolutionary quantitative genetics: how little do we know?,” <i>Annual Review of Genetics</i>, vol. 23. Annual Reviews, pp. 337–370, 1989.","short":"N.H. Barton, M. Turelli, Annual Review of Genetics 23 (1989) 337–370.","ista":"Barton NH, Turelli M. 1989. Evolutionary quantitative genetics: how little do we know? Annual Review of Genetics. 23, 337–370.","apa":"Barton, N. H., &#38; Turelli, M. (1989). Evolutionary quantitative genetics: how little do we know? <i>Annual Review of Genetics</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">https://doi.org/10.1146/annurev.ge.23.120189.002005</a>","chicago":"Barton, Nicholas H, and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” <i>Annual Review of Genetics</i>. Annual Reviews, 1989. <a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">https://doi.org/10.1146/annurev.ge.23.120189.002005</a>.","ama":"Barton NH, Turelli M. Evolutionary quantitative genetics: how little do we know? <i>Annual Review of Genetics</i>. 1989;23:337-370. doi:<a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">10.1146/annurev.ge.23.120189.002005</a>","mla":"Barton, Nicholas H., and Michael Turelli. “Evolutionary Quantitative Genetics: How Little Do We Know?” <i>Annual Review of Genetics</i>, vol. 23, Annual Reviews, 1989, pp. 337–70, doi:<a href=\"https://doi.org/10.1146/annurev.ge.23.120189.002005\">10.1146/annurev.ge.23.120189.002005</a>."},"intvolume":"        23","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","_id":"4312","publication":"Annual Review of Genetics","publisher":"Annual Reviews","doi":"10.1146/annurev.ge.23.120189.002005","title":"Evolutionary quantitative genetics: how little do we know?","date_updated":"2022-02-09T16:01:46Z","month":"01","extern":"1","acknowledgement":"We thank G. E. Bradford, B. Charlesworth, J. A. Coyne, D. Currie, H. Dingle, J. H. Gillespie, A. Gimelfarb, W. G. Hill, A. A. Hoffmann, K. S. Jackson, J. S. Jones, A. Liebowiz, T. Mitchell-aids , T. A. Mousseau, J. Peck, T. Prout, B. Riska, D. A. Roff, H. B. Shaffer, and M. Slatkin for helpful discussions and comments on earlier drafts. Our research is supported\r\nin part by grants from the Science and Engineering Research Council, the National Science Foundation (BSR-8866548), and the Institute of Theoretical Dynamics at University of California, Davis.","quality_controlled":"1","author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Turelli","first_name":"Michael","full_name":"Turelli, Michael"}],"page":"337 - 370","date_created":"2018-12-11T12:08:11Z","publication_identifier":{"issn":["0066-4197"],"eissn":["1545-2948"]},"publication_status":"published","publist_id":"1744","day":"01","year":"1989","language":[{"iso":"eng"}]},{"day":"01","publist_id":"1742","publication_status":"published","date_created":"2018-12-11T12:08:12Z","publication_identifier":{"isbn":["‎ 978-0878936571"]},"author":[{"last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"language":[{"iso":"eng"}],"year":"1989","citation":{"short":"N.H. Barton, in:, D. Otte, J. Endler (Eds.), Speciation and Its Consequences, Sinauer Press, 1989.","ieee":"N. H. Barton, “Founder effect speciation,” in <i>Speciation and its consequences</i>, D. Otte and J. Endler, Eds. Sinauer Press, 1989.","apa":"Barton, N. H. (1989). Founder effect speciation. In D. Otte &#38; J. Endler (Eds.), <i>Speciation and its consequences</i>. Sinauer Press.","ista":"Barton NH. 1989.Founder effect speciation. In: Speciation and its consequences. .","chicago":"Barton, Nicholas H. “Founder Effect Speciation.” In <i>Speciation and Its Consequences</i>, edited by Daniel Otte and John Endler. Sinauer Press, 1989.","mla":"Barton, Nicholas H. “Founder Effect Speciation.” <i>Speciation and Its Consequences</i>, edited by Daniel Otte and John Endler, Sinauer Press, 1989.","ama":"Barton NH. Founder effect speciation. In: Otte D, Endler J, eds. <i>Speciation and Its Consequences</i>. Sinauer Press; 1989."},"editor":[{"first_name":"Daniel","full_name":"Otte, Daniel","last_name":"Otte"},{"last_name":"Endler","first_name":"John","full_name":"Endler, John"}],"main_file_link":[{"url":"https://www.researchgate.net/publication/237005503_Speciation_and_Its_Consequences"}],"oa_version":"None","status":"public","type":"book_chapter","date_published":"1989-01-01T00:00:00Z","extern":"1","month":"01","title":"Founder effect speciation","publisher":"Sinauer Press","date_updated":"2022-02-09T15:03:06Z","_id":"4313","publication":"Speciation and its consequences","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},{"extern":"1","quality_controlled":"1","month":"08","publication":"Genetical Research","doi":"10.1017/S0016672300028378","date_updated":"2022-02-09T14:18:28Z","publisher":"Cambridge University Press","article_processing_charge":"No","oa_version":"None","external_id":{"pmid":["2806907"]},"article_type":"original","volume":54,"date_published":"1989-08-01T00:00:00Z","type":"journal_article","year":"1989","language":[{"iso":"eng"}],"publication_status":"published","publist_id":"1741","day":"01","date_created":"2018-12-11T12:08:12Z","page":"59 - 78","author":[{"orcid":"0000-0002-8548-5240","last_name":"Barton","full_name":"Barton, Nicholas H","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"pmid":1,"_id":"4314","title":"The divergence of a polygenic system under stabilising selection, mutation and drift","abstract":[{"text":"Polygenic variation can be maintained by a balance between mutation and stabilizing selection. When the alleles responsible for variation are rare, many classes of equilibria may be stable. The rate at which drift causes shifts between equilibria is investigated by integrating the gene frequency distribution W2N II (pq)4N mu-1. This integral can be found exactly, by numerical integration, or can be approximated by assuming that the full distribution of allele frequencies is approximately Gaussian. These methods are checked against simulations. Over a wide range of population sizes, drift will keep the population near an equilibrium which minimizes the genetic variance and the deviation from the selective optimum. Shifts between equilibria in this class occur at an appreciable rate if the product of population size and selection on each locus is small (Ns alpha 2 less than 10). The Gaussian approximation is accurate even when the underlying distribution is strongly skewed. Reproductive isolation evolves as populations shift to new combinations of alleles: however, this process is slow, approaching the neutral rate (approximately mu) in small populations.","lang":"eng"}],"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","main_file_link":[{"url":"https://www.cambridge.org/core/journals/genetics-research/article/divergence-of-a-polygenic-system-subject-to-stabilizing-selection-mutation-and-drift/95DF5B589A5C32376F1AAEE99F3200D8"}],"citation":{"apa":"Barton, N. H. (1989). The divergence of a polygenic system under stabilising selection, mutation and drift. <i>Genetical Research</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S0016672300028378\">https://doi.org/10.1017/S0016672300028378</a>","ista":"Barton NH. 1989. The divergence of a polygenic system under stabilising selection, mutation and drift. Genetical Research. 54(1), 59–78.","short":"N.H. Barton, Genetical Research 54 (1989) 59–78.","ieee":"N. H. Barton, “The divergence of a polygenic system under stabilising selection, mutation and drift,” <i>Genetical Research</i>, vol. 54, no. 1. Cambridge University Press, pp. 59–78, 1989.","mla":"Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” <i>Genetical Research</i>, vol. 54, no. 1, Cambridge University Press, 1989, pp. 59–78, doi:<a href=\"https://doi.org/10.1017/S0016672300028378\">10.1017/S0016672300028378</a>.","ama":"Barton NH. The divergence of a polygenic system under stabilising selection, mutation and drift. <i>Genetical Research</i>. 1989;54(1):59-78. doi:<a href=\"https://doi.org/10.1017/S0016672300028378\">10.1017/S0016672300028378</a>","chicago":"Barton, Nicholas H. “The Divergence of a Polygenic System under Stabilising Selection, Mutation and Drift.” <i>Genetical Research</i>. Cambridge University Press, 1989. <a href=\"https://doi.org/10.1017/S0016672300028378\">https://doi.org/10.1017/S0016672300028378</a>."},"intvolume":"        54","status":"public","scopus_import":"1","publication_identifier":{"eissn":["1469-5073"],"issn":["0016-6723"]},"issue":"1"},{"month":"01","quality_controlled":"1","series_title":"FCOS","acknowledgement":"We thank Zohar Manna, Amir Pnueli, and David Dill for their guidance. Moshe Vardi and Joe Halpern gave us very helpful advice for refilling our undecidability results. ","extern":"1","article_processing_charge":"No","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","abstract":[{"text":"A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers over time variables; every modality binds a variable to the time(s) it refers to. TPTL is demonstrated to be both a natural specification language and a suitable formalism for verification and synthesis. A tableau-based decision procedure and model-checking algorithm for TPTL are presented. Several generalizations of TPTL are shown to be highly undecidable.","lang":"eng"}],"date_updated":"2022-02-09T10:40:13Z","publisher":"IEEE","title":"A really temporal logic","doi":"10.1109/SFCS.1989.63473","_id":"4596","publication":"30th Annual Symposium on Foundations of Computer Science","oa_version":"None","citation":{"short":"R. Alur, T.A. Henzinger, in:, 30th Annual Symposium on Foundations of Computer Science, IEEE, 1989, pp. 164–169.","ieee":"R. Alur and T. A. Henzinger, “A really temporal logic,” in <i>30th Annual Symposium on Foundations of Computer Science</i>, Research Triangle Park, NC, USA, 1989, pp. 164–169.","apa":"Alur, R., &#38; Henzinger, T. A. (1989). A really temporal logic. In <i>30th Annual Symposium on Foundations of Computer Science</i> (pp. 164–169). Research Triangle Park, NC, USA: IEEE. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>","ista":"Alur R, Henzinger TA. 1989. A really temporal logic. 30th Annual Symposium on Foundations of Computer Science. FOCS: Foundations of Computer ScienceFCOS, 164–169.","chicago":"Alur, Rajeev, and Thomas A Henzinger. “A Really Temporal Logic.” In <i>30th Annual Symposium on Foundations of Computer Science</i>, 164–69. FCOS. IEEE, 1989. <a href=\"https://doi.org/10.1109/SFCS.1989.63473\">https://doi.org/10.1109/SFCS.1989.63473</a>.","mla":"Alur, Rajeev, and Thomas A. Henzinger. “A Really Temporal Logic.” <i>30th Annual Symposium on Foundations of Computer Science</i>, IEEE, 1989, pp. 164–69, doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>.","ama":"Alur R, Henzinger TA. A really temporal logic. In: <i>30th Annual Symposium on Foundations of Computer Science</i>. FCOS. IEEE; 1989:164-169. doi:<a href=\"https://doi.org/10.1109/SFCS.1989.63473\">10.1109/SFCS.1989.63473</a>"},"main_file_link":[{"url":"https://ieeexplore.ieee.org/document/63473"}],"type":"conference","date_published":"1989-01-01T00:00:00Z","status":"public","year":"1989","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0-8186-1982-1"],"issn":["0018-9162"],"eissn":["1558-0814"]},"date_created":"2018-12-11T12:09:40Z","day":"01","publist_id":"111","publication_status":"published","author":[{"last_name":"Alur","full_name":"Alur, Rajeev","first_name":"Rajeev"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"conference":{"end_date":"1989-11-01","location":"Research Triangle Park, NC, USA","name":"FOCS: Foundations of Computer Science","start_date":"1989-10-30"},"page":"164 - 169"}]