{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:42:43Z","timestamp":1648917763966},"reference-count":4,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Comput. Geom. Appl."],"published-print":{"date-parts":[[2012,6]]},"abstract":"<jats:p> A planar point set S is an (i, t)set of ghost chimneys if there exist lines H<jats:sub>0<\/jats:sub>, H<jats:sub>1<\/jats:sub>,\u2026,H<jats:sub>t-1<\/jats:sub> such that the orthogonal projection of S onto H<jats:sub>j<\/jats:sub> consists of exactly i + j distinct points. We give upper and lower bounds on the maximum value of t in an (i, t) set of ghost chimneys, showing that it is linear in i. <\/jats:p>","DOI":"10.1142\/s0218195912500057","type":"journal-article","created":{"date-parts":[[2012,10,16]],"date-time":"2012-10-16T07:30:09Z","timestamp":1350372609000},"page":"207-214","source":"Crossref","is-referenced-by-count":0,"title":["GHOST CHIMNEYS"],"prefix":"10.1142","volume":"22","author":[{"given":"DAVID","family":"CHARLTON","sequence":"first","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ERIK D.","family":"DEMAINE","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MARTIN L.","family":"DEMAINE","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, MIT, Cambridge, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"VIDA","family":"DUJMOVI\u0106","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Ottawa, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAT","family":"MORIN","sequence":"additional","affiliation":[{"name":"School of Computer Science, Carleton University, Ottawa, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"RYUHEI","family":"UEHARA","sequence":"additional","affiliation":[{"name":"School of Information Science, JAIST, Ishikawa, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,10,16]]},"reference":[{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(90)90055-2"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1137\/080715706"},{"key":"rf5","first-page":"157","volume":"28","author":"Mitra N. J.","journal-title":"ACM Trans. Graphics"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548397002976"}],"container-title":["International Journal of Computational Geometry &amp; Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218195912500057","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:21:07Z","timestamp":1565097667000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195912500057"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":4,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,10,16]]},"published-print":{"date-parts":[[2012,6]]}},"alternative-id":["10.1142\/S0218195912500057"],"URL":"https:\/\/doi.org\/10.1142\/s0218195912500057","relation":{},"ISSN":["0218-1959","1793-6357"],"issn-type":[{"value":"0218-1959","type":"print"},{"value":"1793-6357","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6]]}}}