{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:04:50Z","timestamp":1763467490438},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6041,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1016\/0925-7721(95)00045-3","type":"journal-article","created":{"date-parts":[[2003,4,24]],"date-time":"2003-04-24T22:53:11Z","timestamp":1051224791000},"page":"81-91","source":"Crossref","is-referenced-by-count":20,"title":["Perfect binary space partitions"],"prefix":"10.1016","volume":"7","author":[{"given":"Mark","family":"de Berg","sequence":"first","affiliation":[]},{"given":"Marko M.","family":"de Groot","sequence":"additional","affiliation":[]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00045-3_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01840436","article-title":"Visibility of disjoint polygons","volume":"1","author":"Asano","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00045-3_BIB2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1137\/S0097539791223747","article-title":"Computing and verifying depth orders","volume":"23","author":"de Berg","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00045-3_BIB3","series-title":"Proc. 34th IEEE Symp. Found. Comput. Sci.","first-page":"528","article-title":"Better lower bounds on detecting affine and spherical degeneracies","author":"Erickson","year":"1993"},{"key":"10.1016\/0925-7721(95)00045-3_BIB4","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/965105.807481","article-title":"On visible surface generation by a priori tree structures","volume":"14","author":"Fuchs","year":"1980","journal-title":"Comput. Graph."},{"key":"10.1016\/0925-7721(95)00045-3_BIB5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0925-7721(95)00022-2","article-title":"On a class of O(n2) problems in computational geometry","volume":"5","author":"Gajentaan","year":"1995","journal-title":"Computational Geometry: Theory and Applications"},{"key":"10.1016\/0925-7721(95)00045-3_BIB6","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","article-title":"An output-sensitive algorithm for computing visibility graphs","volume":"20","author":"Ghosh","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00045-3_BIB7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0925-7721(95)00045-3_BIB8","series-title":"Proc. 4th ACM Symp. Comput. Geom.","first-page":"164","article-title":"New methods for computing visibility graphs","author":"Overmars","year":"1988"},{"key":"10.1016\/0925-7721(95)00045-3_BIB9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02187806","article-title":"Efficient binary space partitions for hidden-surface removal and solid modeling","volume":"5","author":"Paterson","year":"1990","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00045-3_BIB10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0196-6774(92)90007-Y","article-title":"Optimal binary space partitions for orthogonal objects","volume":"13","author":"Paterson","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(95)00045-3_BIB11","series-title":"Proc. 11th ACM Symp. Comput. Geom.","first-page":"248","article-title":"Computing the visibility graph via pseudo-triangulation","author":"Pocchiola","year":"1995"},{"key":"10.1016\/0925-7721(95)00045-3_BIB12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","article-title":"Constructing the visibility graph for n line segments in O(n2) time","volume":"20","author":"Welzl","year":"1985","journal-title":"Inform. Process. Lett."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000453?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000453?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:25:00Z","timestamp":1555212300000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["0925772195000453"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00045-3","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}