[{"volume":5,"date_published":"1990-01-01T00:00:00Z","publication":"Discrete & Computational Geometry","page":"35 - 42","citation":{"ama":"Edelsbrunner H, Sharir M. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. *Discrete & Computational Geometry*. 1990;5(1):35-42. doi: 10.1007/BF02187778","apa":"Edelsbrunner, H., & Sharir, M. (1990). The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. *Discrete & Computational Geometry*, *5*(1), 35–42. https://doi.org/ 10.1007/BF02187778","ista":"Edelsbrunner H, Sharir M. 1990. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2. Discrete & Computational Geometry. 5(1), 35–42.","ieee":"H. Edelsbrunner and M. Sharir, “The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2,” *Discrete & Computational Geometry*, vol. 5, no. 1, pp. 35–42, 1990.","short":"H. Edelsbrunner, M. Sharir, Discrete & Computational Geometry 5 (1990) 35–42.","chicago":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” *Discrete & Computational Geometry* 5, no. 1 (1990): 35–42. https://doi.org/ 10.1007/BF02187778.","mla":"Edelsbrunner, Herbert, and Micha Sharir. “The Maximum Number of Ways to Stabn Convex Nonintersecting Sets in the Plane Is 2n−2.” *Discrete & Computational Geometry*, vol. 5, no. 1, Springer, 1990, pp. 35–42, doi: 10.1007/BF02187778."},"type":"journal_article","issue":"1","intvolume":" 5","acknowledgement":"Research of the first author was supported by Amoco Foundation for Faculty Development in Computer Science Grant No. 1-6-44862. Work on this paper by the second author was supported by Office of Naval Research Grant No. N00014-82-K-0381, National Science Foundation Grant No. NSF-DCR-83-20085, and by grants from the Digital Equipment Corporation and the IBM Corporation.","publist_id":"2057","abstract":[{"lang":"eng","text":"LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations\n(i1i2in−1in)(inin−1i2i1) \nis called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight."}],"day":"01","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Herbert Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sharir, Micha","first_name":"Micha","last_name":"Sharir"}],"status":"public","date_updated":"2019-04-26T07:22:39Z","date_created":"2018-12-11T12:06:45Z","extern":1,"month":"01","doi":" 10.1007/BF02187778","publication_status":"published","_id":"4068","publisher":"Springer","quality_controlled":0,"title":"The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2","year":"1990"}]