{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:53:19Z","timestamp":1648738399535},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,12]]},"abstract":"<jats:p> The 3D visibility skeleton is a data structure that encodes the global visibility information of a set of 3D objects. While it is useful in answering global visibility queries, its large size often limits its practical use. In this paper, we address this issue by proposing a subset of the visibility skeleton, which is empirically about 25% to 50% of the whole set. We show that the rest of the data structure can be recovered from the subset as needed, partially or completely. The running time complexity, which we analyze in terms of output size, is efficient. We also prove that the subset is minimal in the sense that the complexity bound ceases to hold if the subset is restricted further. <\/jats:p>","DOI":"10.1142\/s1793830910000899","type":"journal-article","created":{"date-parts":[[2011,1,17]],"date-time":"2011-01-17T08:21:26Z","timestamp":1295252486000},"page":"567-589","source":"Crossref","is-referenced-by-count":0,"title":["A SUCCINCT 3D VISIBILITY SKELETON"],"prefix":"10.1142","volume":"02","author":[{"given":"SYLVAIN","family":"LAZARD","sequence":"first","affiliation":[{"name":"INRIA Nancy Grand Est, LORIA, Nancy, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHRISTOPHE","family":"WEIBEL","sequence":"additional","affiliation":[{"name":"McGill University, Math Department, Montreal, QC H3A 2K6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SUE","family":"WHITESIDES","sequence":"additional","affiliation":[{"name":"University of Victoria, Department of Computer Science, B. C. V8W 3P6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"LINQIAO","family":"ZHANG","sequence":"additional","affiliation":[{"name":"McGill University, School of Computer Science, Montreal, QC H3A 2A7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,6]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244368"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447116"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1183-1"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1145\/318009.318012"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1145\/508357.508362"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1121\/1.1641020"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2003.00722.x"},{"key":"rf18","first-page":"333","volume":"7","author":"He T.","journal-title":"IEEE Trans. Vis. Comput. Graphics"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1007\/BF00365595"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804120"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/BF01187036"},{"key":"rf25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/978-3-540-87744-8_67","volume":"5193","author":"Zhang L.","year":"2008"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:16:06Z","timestamp":1565111766000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,6]]},"published-print":{"date-parts":[[2010,12]]}},"alternative-id":["10.1142\/S1793830910000899"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000899","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12]]}}}