{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:41Z","timestamp":1725851981294},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_20","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"263-274","source":"Crossref","is-referenced-by-count":1,"title":["Constructing Consistent Digital Line Segments"],"prefix":"10.1007","author":[{"given":"Iffat","family":"Chowdhury","sequence":"first","affiliation":[]},{"given":"Matt","family":"Gibson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"key":"20_CR1","unstructured":"Chowdhury, I., Gibson, M.: A characterization of consistent digital linesegments in \n \n \n \n $$\\mathbb{Z}^2$$\n \n \n \n \n Z\n \n 2\n \n \n \n . In: Algorithms - ESA 2015 - 23rd Annual European Symposium,Patras, Greece, 14\u201316 September 2015, Proceedings, pp. 337\u2013348 (2015)"},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/s00454-012-9411-y","volume":"47","author":"T Christ","year":"2012","unstructured":"Christ, T., P\u00e1lv\u00f6lgyi, D., Stojakovic, M.: Consistent digital line segments. Discrete Comput. Geom. 47(4), 691\u2013710 (2012)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00454-009-9166-2","volume":"42","author":"J Chun","year":"2009","unstructured":"Chun, J., Korman, M., N\u00f6llenburg, M., Tokuyama, T.: Consistent digital rays. Discrete Comput. Geom. 42(3), 359\u2013378 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1109\/71.159045","volume":"3","author":"P Corbett","year":"1992","unstructured":"Corbett, P.: Rotator graphs: an efficient topology for point-to-point multiprocessor networks. IEEE Trans. Parallel Distrib. Syst. 3, 622\u2013626 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"20_CR5","unstructured":"Wm. Randolph Franklin: Problems with raster graphics algorithm. In: Peters, F.J., Kessener, L.R.A., van Lierop, M.L.P. (eds.) Data Structures for Raster Graphics, Steensel, Netherlands. Springer, Heidelberg (1985)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Goodrich, M.T., Guibas, L.J., Hershberger, J., Tanenbaum, P.J.: Snap rounding line segments efficiently in two and three dimensions. In: Symposium on Computational Geometry, pp. 284\u2013293 (1997)","DOI":"10.1145\/262839.262985"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Greene, D.H., Yao, F.F.: Finite-resolution computational geometry. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27\u201329 October, pp. 143\u2013152. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.19"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-642-83539-1_15","volume-title":"Theoretical Foundations of Computer Graphics and CAD","author":"MG Luby","year":"1988","unstructured":"Luby, M.G.: Grid geometries which preserve properties of euclidean geometry: a study of graphics line drawing algorithms. In: Earnshaw, R.A. (ed.) Theoretical Foundations of Computer Graphics and CAD, vol. 40, pp. 397\u2013432. Springer, Heidelberg (1988)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/978-3-642-40104-6_46","volume-title":"Algorithms and Data Structures","author":"A Williams","year":"2013","unstructured":"Williams, A.: The greedy Gray code algorithm. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 525\u2013536. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:28:24Z","timestamp":1559406504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}