{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:17:54Z","timestamp":1760440674623},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_24","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T17:52:49Z","timestamp":1194371569000},"page":"252-263","source":"Crossref","is-referenced-by-count":8,"title":["Tight Error Bound of Goemetric Problems on Convex Objects with Imprecise Coordinates"],"prefix":"10.1007","author":[{"given":"Takayuki","family":"Nagai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuki","family":"Tokura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"P.K. Agarwal, M. de Berg, J. Matou\u0161sek, and O. Schwarzkopf: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams, Proceedings of 10th Annual ACM Symposium on Computational Geometry, pages 67\u201375, 1994.","DOI":"10.1145\/177424.177521"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(87)90226-2","volume":"25","author":"M. Atallah","year":"1987","unstructured":"M. Atallah and C. Bajaj: Efficient Algorithms for Common Transversals, Information Processing Letters, vol.25, pages 87\u201391, 1987.","journal-title":"Information Processing Letters"},{"issue":"6","key":"24_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1142\/S0218195997000326","volume":"7","author":"L. Cai","year":"1997","unstructured":"L. Cai, J.M. Keil: Computing Visibility Information in an Inaccurate Simple Polygon, International Journal of Computational Geometry & Applications, vol.7,No. 6, pages 515\u2013537, 1997.","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1142\/S0218195994000100","volume":"4","author":"P.G. Franciosa","year":"1994","unstructured":"P.G. Franciosa, C. Gaibisso, G. Gambosi, M. Talamo: A convex hull algorithm for points with approximately known positions, International Journal of Computational Geometry & Applications, vol. 4,No.2, pages 153\u2013163, 1994.","journal-title":"International Journal of Computational Geometry & Applications"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"L. Guibas, D. Salein, J. Stolfi: Epsilon geometry: building robust algorithm from imprecise computations, Proceedings of 5th Annual ACM Symposium on Computational Geometry, pages 208\u2013217, 1989.","DOI":"10.1145\/73833.73857"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/BF01190154","volume":"9","author":"L. Guibas","year":"1993","unstructured":"L. Guibas, D. Salein, J. Stolfi: Constructing Strongly Convex Approximate Hulls with Inaccurate Primities, Algorithmica, vol. 9, pages 534\u2013560, 1993.","journal-title":"Algorithmica"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0020-0190(89)90136-1","volume":"33","author":"J. Hershberger","year":"1989","unstructured":"J. Hershberger: Finding the Upper Envelope of n Line Segments in O(n log n) Time, Information Processing Letters, vol. 33, pages 169\u2013174, 1989.","journal-title":"Information Processing Letters"},{"key":"24_CR8","series-title":"Lect Notes Comput Sci","first-page":"207","volume-title":"Convex Hull Problem with Imprecise Input","author":"T. Nagai","year":"1998","unstructured":"T. Nagai, S. Yasutome and N. Tokura: Convex Hull Problem with Imprecise Input, Lecture Notes in Computer Science, vol. 1763, pages 207\u2013219, 1998."},{"issue":"3","key":"24_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0925-7721(92)90015-K","volume":"1","author":"D. Rappaport","year":"1992","unstructured":"David Rappaport: A convex hull algorithm for discs, and applications, Computational Geometry: Theory and Applications, vol. 1,No. 3, pages 171\u2013187, 1992.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"24_CR10","unstructured":"J. Robert and G. Toussaint: Computational Geometry and Facility Locations, Proceedings of International Conference on Operations Research and Management Science, pages B-1\u2013B-19, 1990."},{"key":"24_CR11","unstructured":"G. Toussaint: Solving Geometric Problems with the \u201cRotating Calipers\u201d, Proceedings of IEEE MELECON\u201983, pages A10.02\/1\u20134, 1983."}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:19:23Z","timestamp":1556936363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}