{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T20:16:28Z","timestamp":1767212188024},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,9,1]],"date-time":"1986-09-01T00:00:00Z","timestamp":525916800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1986,9]]},"DOI":"10.1007\/bf02240065","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T19:41:35Z","timestamp":1131997295000},"page":"183-197","source":"Crossref","is-referenced-by-count":8,"title":["On some union and intersection problems for polygons with fixed orientations"],"prefix":"10.1007","volume":"36","author":[{"given":"P.","family":"Widmayer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y. F.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. D. F.","family":"Schlag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. K.","family":"Wong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02240065_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"Aho, A. V., Hopcroft, J. E., Ullman, J. D.: The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley 1974."},{"key":"BF02240065_CR2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"29","author":"J. L. Bentley","year":"1980","unstructured":"Bentley, J. L., Wood, D.: An optimal worst case algorithm for reporting intersections of rectangles. IEEE. Trans. Comp.C-29, 571\u2013577 (1980).","journal-title":"IEEE. Trans. Comp. C"},{"key":"BF02240065_CR3","unstructured":"Edelsbrunner, H.: Intersection problems in computational geometry. Institut f\u00fcr Informationsverarbeitung, Graz, Austria, Report F93, 1982."},{"key":"BF02240065_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1051\/ita\/1984180201711","volume":"18","author":"H. Edelsbrunner","year":"1984","unstructured":"Edelsbrunner, H., van Leeuwen, J., Ottmann, Th., Wood, D.: Computing the connected components of simple rectilinear geometrical objects in D-space. RAIRO Theoretical Informatics18, 171\u2013183 (1984).","journal-title":"RAIRO Theoretical Informatics"},{"key":"BF02240065_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0196-6774(83)90044-5","volume":"4","author":"L. Guibas","year":"1983","unstructured":"Guibas, L., Saxe, J.: Solution to <problem 80-15>. Journal of Algorithms4, 177\u2013181 (1983).","journal-title":"Journal of Algorithms"},{"key":"BF02240065_CR6","volume-title":"Conquering contours: efficient algorithms for computational geometry","author":"R. H. G\u00fcting","year":"1983","unstructured":"G\u00fcting, R. H.: Conquering contours: efficient algorithms for computational geometry. Universit\u00e4t Dortmund, Federal Republic of Germany, 1983."},{"key":"BF02240065_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0020-0190(83)90010-8","volume":"16","author":"R. H. G\u00fcting","year":"1983","unstructured":"G\u00fcting, R. H.: Stabbing c-oriented polygons. Information Processing Letters16, 35\u201340 (1983).","journal-title":"Information Processing Letters"},{"key":"BF02240065_CR8","series-title":"Report No. 175","volume-title":"Dynamic c-oriented polygonal intersection searching","author":"R. H. G\u00fcting","year":"1984","unstructured":"G\u00fcting, R. H.: Dynamic c-oriented polygonal intersection searching. Report No. 175, Universit\u00e4t Dortmund, Federal Republic of Germany, 1984."},{"key":"BF02240065_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/3-540-12689-9_105","volume":"158","author":"S. Hertel","year":"1983","unstructured":"Hertel, S., Mehlhorn, K.: Fast triangulation of simple polygons. Proceedings of the 1983 International Foundations of Computation Theory Conference. Lecture Notes in Computer Science158, 207\u2013218 (1983).","journal-title":"Lecture Notes in Computer Science"},{"key":"BF02240065_CR10","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","volume":"33","author":"D. T. Lee","year":"1984","unstructured":"Lee, D. T., Preparata, F. P.: Computational geometry: a survey. IEEE Trans. Comp.C-33 1072\u20131101 (1984).","journal-title":"IEEE Trans. Comp. C"},{"key":"BF02240065_CR11","unstructured":"McCreight, E. M.: Efficient algorithms for enumerating intersecting intervals and rectangles. Xerox PARC Research Report CSL-80-9, 1980."},{"key":"BF02240065_CR12","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","volume":"25","author":"J. Nievergelt","year":"1982","unstructured":"Nievergelt, J., Preparata, F. P.: Plane-sweep algorithms for intersecting geometric figures. Comm. ACM25, 739\u2013747 (1982).","journal-title":"Comm. ACM"},{"key":"BF02240065_CR13","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BFb0030329","volume":"176","author":"Th. Ottmann","year":"1984","unstructured":"Ottmann, Th., Widmayer, P.: Solving visibility problems by using skeleton structures. 11th Symposium on Math. Foundations on Comp. Science, Prague, Lecture Notes in Computer Science176, 459\u2013470 (1984).","journal-title":"Foundations on Comp. Science, Prague, Lecture Notes in Computer Science"},{"key":"BF02240065_CR14","volume-title":"Computational geometry","author":"M. Shamos","year":"1978","unstructured":"Shamos, M.: Computational geometry. Dept. of Comp. Science, Yale University, New Haven, CT, 1978."},{"key":"BF02240065_CR15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0196-6774(82)90016-5","volume":"3","author":"V. K. Vaishnavi","year":"1982","unstructured":"Vaishnavi, V. K., Wood, D.: Rectilinear line, segment intersection, layered segment trees, and dynamization. Journal of Algorithms3, 160\u2013176 (1982).","journal-title":"Journal of Algorithms"},{"key":"BF02240065_CR16","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0196-6774(81)90027-4","volume":"2","author":"J. Leeuwen van","year":"1981","unstructured":"van Leeuwen, J., Wood, D.: The measure problem for rectangular ranges in d-space. Journal of Algorithms2, 282\u2013300 (1981).","journal-title":"Journal of Algorithms"},{"key":"BF02240065_CR17","doi-asserted-by":"crossref","unstructured":"Widmayer, P., Wu, Y. F., Wong, C. K.: Distance problems in computational geometry for fixed orientations. ACM SIGGRAPH Symposium on Computational Geometry. Baltimore, MD, 1985, 186\u2013195.","DOI":"10.1145\/323233.323258"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02240065.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02240065\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02240065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:18:09Z","timestamp":1557940689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02240065"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,9]]}},"alternative-id":["BF02240065"],"URL":"https:\/\/doi.org\/10.1007\/bf02240065","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,9]]}}}