{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:23:43Z","timestamp":1774599823370,"version":"3.50.1"},"reference-count":7,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1979,9,1]],"date-time":"1979-09-01T00:00:00Z","timestamp":304992000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1979,9]]},"DOI":"10.1109\/tc.1979.1675432","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"643-647","source":"Crossref","is-referenced-by-count":671,"title":["Algorithms for Reporting and Counting Geometric Intersections"],"prefix":"10.1109","volume":"C-28","author":[{"family":"Bentley","sequence":"first","affiliation":[{"name":"Departments of Computer Science and Mathematics, Carnegie-Mellon University"}]},{"family":"Ottmann","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"241","article-title":"four-dimensional binary search trees as a means to speed up associative searches in design rule verification of integrated circuits","volume":"2","author":"lauther","year":"1978","journal-title":"J Des Autom and Fault-Tolerant Comput"},{"key":"ref3","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Volume 3 Sorting and Searching"},{"key":"ref6","first-page":"395","article-title":"eine neue klass von ausgeglichenen binarbaumen","volume":"9","author":"ottmann","year":"1976","journal-title":"Angewandte Informatik"},{"key":"ref5","first-page":"37","author":"van leeuwen","year":"0","journal-title":"Foundations of Computer Science II"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1976.16"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(77)90070-9"},{"key":"ref1","first-page":"179","article-title":"fast algorithms for lsi artwork analysis","volume":"2","author":"baird","year":"1978","journal-title":"J Design Automat Fault-Tolerant Comput"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35185\/01675432.pdf?arnumber=1675432","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:08:53Z","timestamp":1752102533000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675432\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":7,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tc.1979.1675432","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}