{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:32:11Z","timestamp":1648992731086},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2000,10]]},"abstract":"<jats:p> Given a set S of n non-intersecting line segments in the plane, we vpresent a new technique for efficiently traversing the endpoint visibility graph of S to solve a variety of visibility problems in output sensitive time. In particular, we develop two techniques to compute the 2n visibility polygons of the endpoints of S, in output sensitive time. <\/jats:p><jats:p> Depth-first spiralling is a technique that relies on the ordered endpoint visibility graph information to traverse the endpoints of S in a spiral-like manner using a combination of Jarvis' March and depth-first search. It is a practical method and has been implemented in C++ using LEDA. <\/jats:p>","DOI":"10.1142\/s0218195900000309","type":"journal-article","created":{"date-parts":[[2003,5,7]],"date-time":"2003-05-07T04:18:55Z","timestamp":1052281135000},"page":"535-552","source":"Crossref","is-referenced-by-count":4,"title":["VISIBILITY STABS AND DEPTH-FIRST SPIRALLING ON LINE SEGMENTS IN OUTPUT SENSITIVE TIME"],"prefix":"10.1142","volume":"10","author":[{"given":"MARK","family":"KEIL","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Saskatchewan, Saskatoon, Sask, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DAVID M.","family":"MOUNT","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"WISMATH","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, University of Lethbridge, 4401 University Drive, Lethbridge, AB, Canada, T1K 3M4, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840436"},{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90249-H"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574703"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553883"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(73)90020-3"},{"key":"p_9","first-page":"38","author":"Mehlhorn K.","year":"1995","journal-title":"Communications of the ACM"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000204"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90038-X"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(86)90015-2"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90044-4"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90033-R"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195900000309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T08:15:01Z","timestamp":1565079301000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195900000309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":11,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,10]]}},"alternative-id":["10.1142\/S0218195900000309"],"URL":"https:\/\/doi.org\/10.1142\/s0218195900000309","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}