[{"creator":{"login":"alisjak","id":"ea97e931-d5af-11eb-85d4-e6957dddbf17"},"extern":"1","publist_id":"2051","volume":34,"date_created":"2018-12-11T12:06:46Z","dini_type":"doc-type:article","date_updated":"2022-02-21T13:19:52Z","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Overmars","first_name":"Mark"},{"last_name":"Welzl","first_name":"Emo"},{"last_name":"Hartman","first_name":"Irith"},{"first_name":"Jack","last_name":"Feldman"}],"publication_status":"published","publication_identifier":{"eissn":[],"issn":[]},"month":"01","language":[{}],"quality_controlled":"1","main_file_link":[{"url":"https://www.tandfonline.com/doi/abs/10.1080/00207169008803871"}],"issue":"3-4","abstract":[{"lang":"eng"}],"type":"journal_article","oa_version":"None","intvolume":" 34","status":"public","_id":"4070","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","article_processing_charge":"No","uri_base":"https://research-explorer.ista.ac.at","day":"01","scopus_import":"1","dc":{"language":["eng"],"date":["1990"],"title":["Ranking intervals under visibility constraints"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1080/00207169008803871","info:eu-repo/semantics/altIdentifier/issn/0020-7160","info:eu-repo/semantics/altIdentifier/issn/1029-0265"],"publisher":["Taylor & Francis"],"source":["Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 1990;34(3-4):129-144. doi:10.1080/00207169008803871"],"rights":["info:eu-repo/semantics/closedAccess"],"creator":["Edelsbrunner, Herbert","Overmars, Mark","Welzl, Emo","Hartman, Irith","Feldman, Jack"],"description":["Let S be a set of n closed intervals on the x-axis. A ranking assigns to each interval, s, a distinct rank, p(s)∊ [1, 2,…,n]. We say that s can see t if p(s)
International Journal of Computer Mathematics. Taylor & Francis, 1990. https://doi.org/10.1080/00207169008803871.","short":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, J. Feldman, International Journal of Computer Mathematics 34 (1990) 129–144.","mla":"Edelsbrunner, Herbert, et al. “Ranking Intervals under Visibility Constraints.” International Journal of Computer Mathematics, vol. 34, no. 3–4, Taylor & Francis, 1990, pp. 129–44, doi:10.1080/00207169008803871.","apa":"Edelsbrunner, H., Overmars, M., Welzl, E., Hartman, I., & Feldman, J. (1990). Ranking intervals under visibility constraints. International Journal of Computer Mathematics. Taylor & Francis. https://doi.org/10.1080/00207169008803871","ieee":"H. Edelsbrunner, M. Overmars, E. Welzl, I. Hartman, and J. Feldman, “Ranking intervals under visibility constraints,” International Journal of Computer Mathematics, vol. 34, no. 3–4. Taylor & Francis, pp. 129–144, 1990.","ista":"Edelsbrunner H, Overmars M, Welzl E, Hartman I, Feldman J. 1990. Ranking intervals under visibility constraints. International Journal of Computer Mathematics. 34(3–4), 129–144."},"publication":"International Journal of Computer Mathematics"}]