[{"quality_controlled":0,"extern":1,"issue":"1","date_updated":"2021-01-12T07:54:25Z","title":"Implicitly representing arrangements of lines or segments","year":"1989","status":"public","publication_status":"published","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.","doi":"10.1007/BF02187742","volume":4,"day":"01","date_published":"1989-12-01T00:00:00Z","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Herbert Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Guibas, Leonidas","first_name":"Leonidas","last_name":"Guibas"},{"first_name":"John","full_name":"Hershberger, John","last_name":"Hershberger"},{"last_name":"Seidel","full_name":"Seidel, Raimund","first_name":"Raimund"},{"last_name":"Sharir","first_name":"Micha","full_name":"Sharir, Micha"},{"full_name":"Snoeyink, Jack","first_name":"Jack","last_name":"Snoeyink"},{"last_name":"Welzl","first_name":"Emo","full_name":"Welzl, Emo"}],"citation":{"apa":"Edelsbrunner, H., Guibas, L., Hershberger, J., Seidel, R., Sharir, M., Snoeyink, J., & Welzl, E. (1989). Implicitly representing arrangements of lines or segments. *Discrete & Computational Geometry*. Springer. https://doi.org/10.1007/BF02187742","chicago":"Edelsbrunner, Herbert, Leonidas Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, and Emo Welzl. “Implicitly Representing Arrangements of Lines or Segments.” *Discrete & Computational Geometry*. Springer, 1989. https://doi.org/10.1007/BF02187742.","ieee":"H. Edelsbrunner *et al.*, “Implicitly representing arrangements of lines or segments,” *Discrete & Computational Geometry*, vol. 4, no. 1. Springer, pp. 433–466, 1989.","short":"H. Edelsbrunner, L. Guibas, J. Hershberger, R. Seidel, M. Sharir, J. Snoeyink, E. Welzl, Discrete & Computational Geometry 4 (1989) 433–466.","ista":"Edelsbrunner H, Guibas L, Hershberger J, Seidel R, Sharir M, Snoeyink J, Welzl E. 1989. Implicitly representing arrangements of lines or segments. Discrete & Computational Geometry. 4(1), 433–466.","ama":"Edelsbrunner H, Guibas L, Hershberger J, et al. Implicitly representing arrangements of lines or segments. *Discrete & Computational Geometry*. 1989;4(1):433-466. doi:10.1007/BF02187742","mla":"Edelsbrunner, Herbert, et al. “Implicitly Representing Arrangements of Lines or Segments.” *Discrete & Computational Geometry*, vol. 4, no. 1, Springer, 1989, pp. 433–66, doi:10.1007/BF02187742."},"month":"12","page":"433 - 466","type":"journal_article","publication":"Discrete & Computational Geometry","date_created":"2018-12-11T12:06:52Z","publist_id":"2036","publisher":"Springer","_id":"4088","intvolume":" 4","abstract":[{"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.","lang":"eng"}]}]