{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T11:27:31Z","timestamp":1749122851438},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0097-8493(89)90059-9","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:49:30Z","timestamp":1060300170000},"page":"167-183","source":"Crossref","is-referenced-by-count":25,"title":["An algorithm for computing the union, intersection or difference of two polygons"],"prefix":"10.1016","volume":"13","author":[{"given":"Avraham","family":"Margalit","sequence":"first","affiliation":[]},{"given":"Gary D.","family":"Knott","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-8493(89)90059-9_BIB1","series-title":"An Introduction","article-title":"Computational Geometry","author":"Preparata","year":"1985"},{"key":"10.1016\/0097-8493(89)90059-9_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0097-8493(89)90059-9_BIB3","first-page":"30","article-title":"Boolean operations in solid modeling\u2014boundary evaluation and merging algorithms","volume":"73(1)","author":"Requicha","year":"1985"},{"issue":"2","key":"10.1016\/0097-8493(89)90059-9_BIB4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"The quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"ACM Comput. Surveys"},{"issue":"10","key":"10.1016\/0097-8493(89)90059-9_BIB5","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1109\/TC.1980.1675470","article-title":"Set membership classification: A unified approach to geometric intersection problems","volume":"C-29","author":"Tilove","year":"1980","journal-title":"IEEE Trans. Comp."},{"issue":"1","key":"10.1016\/0097-8493(89)90059-9_BIB6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/3973.3975","article-title":"Object representation by means of non-minimal division quadtrees and octrees","volume":"4","author":"Ayala","year":"1985","journal-title":"ACM Trans. Graphics"},{"issue":"2","key":"10.1016\/0097-8493(89)90059-9_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TPAMI.1979.4766900","article-title":"Operation on images using quadtrees","volume":"1","author":"Hunter","year":"1979","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/0097-8493(89)90059-9_BIB8","series-title":"Computing geometric boolean operations by input directed decomposition","author":"Vanecek","year":"1987"},{"issue":"6","key":"10.1016\/0097-8493(89)90059-9_BIB9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MCG.1986.276741","article-title":"Boolean operations on n-dimensional objects","volume":"6","author":"Putnam","year":"1986","journal-title":"IEEE Comput. Graphics and Applications"},{"key":"10.1016\/0097-8493(89)90059-9_BIB10","series-title":"A program to determine whether two line segments intersect","author":"Knott","year":"1987"},{"key":"10.1016\/0097-8493(89)90059-9_BIB11","article-title":"Reporting line segment intersections in the plane","author":"Mairson","year":"1983"},{"key":"10.1016\/0097-8493(89)90059-9_BIB12","series-title":"SIGGRAPH 80 Proceedings","first-page":"10","article-title":"Polygon comparison using graph representation","author":"Weiler","year":"1980"},{"issue":"1","key":"10.1016\/0097-8493(89)90059-9_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7529.7530","article-title":"Boolean operations of 2-manifolds through vertex neighborhood classification","volume":"5","author":"Mantyla","year":"1986","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0097-8493(89)90059-9_BIB14","series-title":"Introduction to Solid Modeling","author":"Mantyla","year":"1987"},{"key":"10.1016\/0097-8493(89)90059-9_BIB15","article-title":"An efficient algorithm for finding the union, intersection, and difference of spatial domains","author":"Eastman","year":"1972"},{"key":"10.1016\/0097-8493(89)90059-9_BIB16","article-title":"Robust set operations on polyhedral solids","author":"Hoffmann","year":"1987"},{"issue":"10","key":"10.1016\/0097-8493(89)90059-9_BIB17","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1145\/358656.358681","article-title":"Plane-sweep algorithms for intersecting geometric figures","volume":"vol. 25","author":"Nievergelt","year":"1982","journal-title":"Commun. of the ACM"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097849389900599?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097849389900599?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T06:30:05Z","timestamp":1552631405000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097849389900599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0097849389900599"],"URL":"https:\/\/doi.org\/10.1016\/0097-8493(89)90059-9","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}