{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:43:53Z","timestamp":1742993033746,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319739144"},{"type":"electronic","value":"9783319739151"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_8","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"88-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructing Generalized Staircase Polygons with Uniform Step Length"],"prefix":"10.1007","author":[{"given":"Nodari","family":"Sitchinava","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darren","family":"Strash","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"01","key":"8_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1142\/S0218195993000038","volume":"03","author":"J Abello","year":"1993","unstructured":"Abello, J., E\u011fecio\u011flu, \u00d6.: Visibility graphs of staircase polygons with uniform step length. Int. J. Comput. Geom. Ap. 03(01), 27\u201337 (1993)","journal-title":"Int. J. Comput. Geom. Ap."},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF02570710","volume":"14","author":"J Abello","year":"1995","unstructured":"Abello, J., E\u011fecio\u011flu, \u00d6., Kumar, K.: Visibility graphs of staircase polygons and the weak Bruhat order, I: from visibility graphs to maximal chains. Discrete Comput. Geom. 14(3), 331\u2013358 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59175-3_77","volume-title":"LATIN \u201995: Theoretical Informatics","author":"J Abello","year":"1995","unstructured":"Abello, J., Kumar, K.: Visibility graphs of 2-spiral polygons (Extended abstract). In: Baeza-Yates, R., Goles, E., Poblete, P.V. (eds.) LATIN 1995. LNCS, vol. 911, pp. 1\u201315. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59175-3_77"},{"issue":"4","key":"8_CR4","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/s00454-002-2881-6","volume":"28","author":"J Abello","year":"2002","unstructured":"Abello, J., Kumar, K.: Visibility graphs and oriented matroids. Discrete Comput. Geom. 28(4), 449\u2013465 (2002)","journal-title":"Discrete Comput. Geom."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/B978-044482537-7\/50020-6","volume-title":"Handbook of Computational Geometry","author":"T Asano","year":"2000","unstructured":"Asano, T., Ghosh, S.K., Shermer, T.C.: Visibility in the plane. In: Urrutia, J.-R.S.J. (ed.) Handbook of Computational Geometry, pp. 829\u2013876. North-Holland, Amsterdam (2000). Chap. 19"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of 48th ACM Symposium on Theory of Computing (STOC 2016), pp. 684\u2013697, New York, NY, USA. ACM (2016)","DOI":"10.1145\/2897518.2897542"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01300372","volume":"14","author":"S-H Choi","year":"1995","unstructured":"Choi, S.-H., Shin, S.Y., Chwa, K.-Y.: Characterizing and recognizing the visibility graph of a funnel-shaped polygon. Algorithmica 14(1), 27\u201351 (1995)","journal-title":"Algorithmica"},{"key":"8_CR8","unstructured":"Colley, P.: Visibility graphs of uni-monotone polygons. Master\u2019s thesis, Department of Computer Science, University of Waterloo, Waterloo, Canada (1991)"},{"key":"8_CR9","unstructured":"Colley, P.: Recognizing visibility graphs of unimonotone polygons. In: Proceedings of 4th Canadian Conference on Computational Geometry, pp. 29\u201334 (1992)"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-32241-9_20","volume-title":"Computing and Combinatorics","author":"S Durocher","year":"2012","unstructured":"Durocher, S., Mehrabi, S.: Computing partitions of rectilinear polygons with minimum stabbing number. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 228\u2013239. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32241-9_20"},{"key":"8_CR11","unstructured":"ElGindy, H.: Hierarchical decomposition of polygons with applications. Ph.D. thesis, McGill University, Montreal, Canada (1985)"},{"issue":"1","key":"8_CR12","first-page":"108","volume":"6","author":"W Evans","year":"2015","unstructured":"Evans, W., Saeedi, N.: On characterizing terrain visibility graphs. J. Comput. Geom. 6(1), 108\u2013141 (2015)","journal-title":"J. Comput. Geom."},{"key":"8_CR13","unstructured":"Everett, H.: Visibility graph recognition. Ph.D. thesis, University of Toronto (1990)"},{"issue":"1","key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(90)90026-B","volume":"11","author":"H Everett","year":"1990","unstructured":"Everett, H., Corneil, D.: Recognizing visibility graphs of spiral polygons. J. Algorithms 11(1), 1\u201326 (1990)","journal-title":"J. Algorithms"},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"5","key":"8_CR16","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility. SIAM J. Comput. 20(5), 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0925-7721(01)00068-2","volume":"23","author":"L Jackson","year":"2002","unstructured":"Jackson, L., Wismath, S.: Orthogonal polygon reconstruction from stabbing information. Comp. Geom. Theor. Appl. 23(1), 69\u201383 (2002)","journal-title":"Comp. Geom. Theor. Appl."},{"key":"8_CR18","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Sitchinava, N., Strash, D.: Reconstructing generalized staircase polygons with uniform step length. arXiv preprint https:\/\/arxiv.org\/abs\/1708.09842 (2017)","DOI":"10.1007\/978-3-319-73915-1_8"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:22:35Z","timestamp":1710242555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}