{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:27Z","timestamp":1759638987903},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1007\/bf01891832","type":"journal-article","created":{"date-parts":[[2005,7,5]],"date-time":"2005-07-05T07:18:01Z","timestamp":1120547881000},"page":"457-472","source":"Crossref","is-referenced-by-count":13,"title":["Numerical stability of a convex hull algorithm for simple polygons"],"prefix":"10.1007","volume":"10","author":[{"given":"J. W.","family":"Jaromczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. W.","family":"Wasilkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01891832_CR1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/TIT.1984.1056845","volume":"30","author":"B. K. Bhattacharya","year":"1984","unstructured":"B. K. Bhattacharya and H. ElGindy, A new linear convex hull algorithm for simple polygon,IEEE Transactions on Information Theory,30, 85\u201388, 1984.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF01891832_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61568-9","volume-title":"Algorithms in Combinatorial Geometry","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner,Algorithms in Combinatorial Geometry, Springer-Verlag, New York, 1987."},{"key":"BF01891832_CR3","doi-asserted-by":"crossref","unstructured":"S. Fortune, Stable maintenance of point-set triangulations in two dimension,Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pp. 494\u2013499, 1989.","DOI":"10.1109\/SFCS.1989.63524"},{"key":"BF01891832_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. L. Graham","year":"1972","unstructured":"R. L. Graham, An efficient algorithm for determining the convex hull of a finite planar set,Information Processing Letters,1, 132\u2013133, 1972.","journal-title":"Information Processing Letters"},{"issue":"4","key":"BF01891832_CR5","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0196-6774(83)90013-5","volume":"4","author":"R. L. Graham","year":"1983","unstructured":"R. L. Graham and F. F. Yao, Finding the convex hull of a simple polygon,Journal of Algorithms,4(4), 324\u2013331, 1983.","journal-title":"Journal of Algorithms"},{"key":"BF01891832_CR6","doi-asserted-by":"crossref","unstructured":"L. Guibas, D. Salesin, and J. Stolfi, Epsilon geometry: building robust algorithms from imprecise computations,Proceedings of the 5th Annual ACM Symposium on Computational Geometry, pp. 208\u2013217, 1989.","DOI":"10.1145\/73833.73857"},{"key":"BF01891832_CR7","series-title":"Lecture Notes in Computer Science, Vol. 450","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-52921-7_75","volume-title":"Proceedings of the International Symposium SIGAL '90","author":"L. Guibas","year":"1990","unstructured":"L. Guibas, D. Salesin, and J. Stolfi, Constructing strongly convex approximate hulls with inaccurate primitives,Proceedings of the International Symposium SIGAL '90, Lecture Notes in Computer Science, Vol. 450, Springer-Verlag, Berlin, pp. 261\u2013270, 1990."},{"issue":"2","key":"BF01891832_CR8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF00993195","volume":"12","author":"D. T. Lee","year":"1983","unstructured":"D. T. Lee, On finding the convex hull of a simple polygon,International Journal on Computing and Information Sciences,12(2), 87\u201398, 1983.","journal-title":"International Journal on Computing and Information Sciences"},{"key":"BF01891832_CR9","doi-asserted-by":"crossref","unstructured":"Z. Li and V. Milenkovic, Constructing strongly convex hulls using exact and rounded arithmetic,Proceedings of the 6th Annual ACM Symposium on Computational Geometry, pp. 235\u2013245, 1990.","DOI":"10.1145\/98524.98577"},{"key":"BF01891832_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","volume":"9","author":"D. McCallum","year":"1979","unstructured":"D. McCallum and D. Avis, A linear time algorithm for finding the convex hull of a simple polygon,Information Processing Letters,9, 201\u2013206, 1979.","journal-title":"Information Processing Letters"},{"key":"BF01891832_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A. A. Melkman","year":"1987","unstructured":"A. A. Melkman, On line construction of the convex hull of a simple polyline,Information Processing Letters,25, 11\u201312, 1987.","journal-title":"Information Processing Letters"},{"key":"BF01891832_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. Preparata","year":"1985","unstructured":"F. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."},{"key":"BF01891832_CR13","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/0031-3203(86)90043-9","volume":"13","author":"S. Y. Shin","year":"1986","unstructured":"S. Y. Shin and T. C. Woo, Finding the convex hull of a simple polygon in linear time,Pattern Recognition,13, 453\u2013458, 1986.","journal-title":"Pattern Recognition"},{"key":"BF01891832_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0031-3203(91)90087-L","volume":"24","author":"G. T. Toussaint","year":"1991","unstructured":"G. T. Toussaint, A counter-example to a convex hull algorithm for polygons,Pattern Recognition,24, 183\u2013184, 1991.","journal-title":"Pattern Recognition"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01891832.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01891832\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01891832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T04:22:24Z","timestamp":1586319744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01891832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["BF01891832"],"URL":"https:\/\/doi.org\/10.1007\/bf01891832","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}