{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:55:02Z","timestamp":1762271702926,"version":"build-2065373602"},"reference-count":22,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1996,9,1]],"date-time":"1996-09-01T00:00:00Z","timestamp":841536000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6163,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1996,9]]},"DOI":"10.1016\/0925-7721(95)00016-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:56:11Z","timestamp":1027637771000},"page":"303-314","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":33,"title":["Minimal tangent visibility graphs"],"prefix":"10.1016","volume":"6","author":[{"given":"Michel","family":"Pocchiola","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gert","family":"Vegter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00016-X_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)00016-X_BIB2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0020-0190(91)90249-H","article-title":"Minimal visibility graphs","volume":"37","author":"Campbell","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00016-X_BIB3","article-title":"Un code pour les graphes planaires et ses applications","volume":"27","author":"Cori","year":"1975"},{"key":"10.1016\/0925-7721(95)00016-X_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0022-0000(89)90038-X","article-title":"Topologically sweeping an arrangement","volume":"38","author":"Edelsbrunner","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0925-7721(95)00016-X_BIB5","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."},{"year":"1993","author":"Goodman","key":"10.1016\/0925-7721(95)00016-X_BIB6"},{"issue":"1","key":"10.1016\/0925-7721(95)00016-X_BIB7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1090\/S0002-9947-1990-1024774-2","article-title":"Rotation and winding numbers for polygons and curves","volume":"322","author":"Gr\u00fcnbaum","year":"1990","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0925-7721(95)00016-X_BIB8","first-page":"13","article-title":"Computing the visibility graph of n line segments in O(n2) time","volume":"26","author":"Guibas","year":"1985","journal-title":"Bull. EATCS"},{"key":"10.1016\/0925-7721(95)00016-X_BIB9","first-page":"273","article-title":"Theory of maps on orientable surfaces","volume":"37","author":"Jones","year":"1978"},{"key":"10.1016\/0925-7721(95)00016-X_BIB10","series-title":"Proc. 4th Annu. ACM Sympos. Comput. Geometry","first-page":"178","article-title":"Efficient algorithms for euclidean shortest paths and visibility problems with polygonal obstacles","author":"Kapoor","year":"1988"},{"issue":"10","key":"10.1016\/0925-7721(95)00016-X_BIB11","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/359156.359164","article-title":"An algorithm for planning collision-free paths among polyhedral obstacles","volume":"22","author":"Lozano-P\u00e9rez","year":"1979","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/0925-7721(95)00016-X_BIB12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1142\/S0218195993000075","article-title":"Computational geometry column 18","volume":"3","author":"O'Rourke","year":"1993","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/0925-7721(95)00016-X_BIB13","series-title":"Proceedings of the 4th Annual ACM Sympos. Comput. Geometry","first-page":"164","article-title":"New methods for computing visibility graphs","author":"Overmars","year":"1988"},{"key":"10.1016\/0925-7721(95)00016-X_BIB14","series-title":"Proc. 9th Annu. ACM Sympos. Comput. Geom.","first-page":"328","article-title":"The visibility complex","author":"Pocchiola","year":"1993"},{"article-title":"Order types and visibility types of configurations of disjoint convex plane sets","year":"1994","author":"Pocchiola","key":"10.1016\/0925-7721(95)00016-X_BIB15"},{"key":"10.1016\/0925-7721(95)00016-X_BIB16","series-title":"Proc. of the 11th Ann. ACM Sympos. Comput. Geometry","first-page":"248","article-title":"Computing visibility graphs via pseudo-triangulations","author":"Pocchiola","year":"1995"},{"key":"10.1016\/0925-7721(95)00016-X_BIB17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0020-0190(86)90045-1","article-title":"Shortest paths in the plane with convex polygonal obstacles","volume":"23","author":"Rohnert","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00016-X_BIB18","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0020-0190(88)90022-1","article-title":"Time and space efficient algorithms for shortest paths between convex polygons","volume":"27","author":"Rohnert","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00016-X_BIB19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0020-0190(87)90038-X","article-title":"A tight lower bound on the size of visibility graphs","volume":"26","author":"Shen","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00016-X_BIB20","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(93)90205-N","article-title":"A note on minimal visibility graphs","volume":"46","author":"Shen","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(95)00016-X_BIB21","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF01840385","article-title":"A fast algorithm for computing sparse visibility graphs","volume":"5","author":"Sudarshan","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0925-7721(95)00016-X_BIB22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0020-0190(85)90044-4","article-title":"Constructing the visibility graph of n line segments in the plane","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:092577219500016X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219500016X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:41:07Z","timestamp":1762270867000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219500016X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,9]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,9]]}},"alternative-id":["092577219500016X"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00016-x","relation":{},"ISSN":["0925-7721"],"issn-type":[{"type":"print","value":"0925-7721"}],"subject":[],"published":{"date-parts":[[1996,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Minimal tangent visibility graphs","name":"articletitle","label":"Article Title"},{"value":"Computational Geometry","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0925-7721(95)00016-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1996 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}