{"extern":"1","language":[{"iso":"eng"}],"oa_version":"None","day":"01","doi":"10.1145/336154.336176","publist_id":"4507","page":"50 - 56","quality_controlled":"1","date_updated":"2023-05-03T12:41:02Z","conference":{"end_date":"2000-04-14","name":"SCG: Symposium on Computational Geometry","location":"Clear Water Bay Kowloon, Hong Kong","start_date":"2000-06-12"},"user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","publication_status":"published","month":"05","publisher":"ACM","publication_identifier":{"isbn":["9781581132243"]},"year":"2000","article_processing_charge":"No","status":"public","citation":{"apa":"Wagner, U., & Welzl, E. (2000). Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. In Proceedings of the 16th annual symposium on Computational geometry (pp. 50–56). Clear Water Bay Kowloon, Hong Kong: ACM. https://doi.org/10.1145/336154.336176","ieee":"U. Wagner and E. Welzl, “Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem,” in Proceedings of the 16th annual symposium on Computational geometry, Clear Water Bay Kowloon, Hong Kong, 2000, pp. 50–56.","ista":"Wagner U, Welzl E. 2000. Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. Proceedings of the 16th annual symposium on Computational geometry. SCG: Symposium on Computational Geometry, 50–56.","mla":"Wagner, Uli, and Emo Welzl. “Origin-Embracing Distributions or a Continuous Analogue of the Upper Bound Theorem.” Proceedings of the 16th Annual Symposium on Computational Geometry, ACM, 2000, pp. 50–56, doi:10.1145/336154.336176.","ama":"Wagner U, Welzl E. Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem. In: Proceedings of the 16th Annual Symposium on Computational Geometry. ACM; 2000:50-56. doi:10.1145/336154.336176","short":"U. Wagner, E. Welzl, in:, Proceedings of the 16th Annual Symposium on Computational Geometry, ACM, 2000, pp. 50–56.","chicago":"Wagner, Uli, and Emo Welzl. “Origin-Embracing Distributions or a Continuous Analogue of the Upper Bound Theorem.” In Proceedings of the 16th Annual Symposium on Computational Geometry, 50–56. ACM, 2000. https://doi.org/10.1145/336154.336176."},"type":"conference","title":"Origin-embracing distributions or a continuous analogue of the Upper Bound Theorem","publication":"Proceedings of the 16th annual symposium on Computational geometry","author":[{"last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli","orcid":"0000-0002-1494-0568","first_name":"Uli"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"date_created":"2018-12-11T11:57:33Z","_id":"2418","scopus_import":"1","date_published":"2000-05-01T00:00:00Z","abstract":[{"lang":"eng","text":"For an absolutely continuous probability measure μ on Rd and a nonnegative integer k, let sk(μ, 0) denote the probability that the convex hull of k+d+1 random points which are i.i.d. according to μ contains the origin 0. For d and k given, we determine a tight upper bound on sk(μ, 0), and we characterize the measures in Rd which attain this bound. This result can be considered a continuous analogue of the Upper Bound Theorem for the maximal number of faces of convex polytopes with a given number of vertices. For our proof we introduce so-called h-functions, continuous counterparts of h-vectors for simplicial convex polytopes."}]}