{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:33Z","timestamp":1725664053007},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_80","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T05:58:01Z","timestamp":1330235881000},"page":"269-278","source":"Crossref","is-referenced-by-count":1,"title":["Approximating vertices of a convex polygon with grid points in the polygon"],"prefix":"10.1007","author":[{"given":"H. S.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. C.","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"D. H. Greene and F. F. Yao, Finite-resolution computational geometry, Proc. 27th Symposium on Foundations of Computer Science, pp. 143\u2013152, 1986.","DOI":"10.1109\/SFCS.1986.19"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"H. S. Lee and R. C. Chang, Hitting Grid Points in a Convex Polygon with Straight Lines, Lecture Notes in Computer Science (ISA '91 Algorithms), Vol. 557, pp. 176\u2013189, Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54945-5_61"},{"key":"29_CR3","volume-title":"Techn. Rep.","author":"H. S. Lee","year":"1991","unstructured":"H. S. Lee and R. C. Chang, A Fast Algorithm for Weber Problem on a Grid, Techn. Rep., Science and Info. Engineering, NCTU, Taiwan, 1991."},{"key":"29_CR4","unstructured":"W. J. LeVeque, Fundamentals of Number Theory, Addison-Wesley, 1977."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"L. Lovasz, An Algorithmic Theory of Numbers, Graphs and Complexity, Society for Industrial and Applied Mathematics, Pennsylvania, 1986.","DOI":"10.1137\/1.9781611970203"},{"key":"29_CR6","unstructured":"S. Mehta, M. Mukherjee and G. Nagy, Constrained integer approximation to 2-D line intersections, Second Canadian Conf. on Computational Geometry, Ottawa, Canada, August 1990, 302\u2013305."},{"key":"29_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:03:01Z","timestamp":1605628981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}