{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:02:32Z","timestamp":1773316952075,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf01994880","type":"journal-article","created":{"date-parts":[[2005,8,4]],"date-time":"2005-08-04T20:22:09Z","timestamp":1123186929000},"page":"249-267","source":"Crossref","is-referenced-by-count":69,"title":["Applications of a semi-dynamic convex hull algorithm"],"prefix":"10.1007","volume":"32","author":[{"given":"John","family":"Hershberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01994880_CR1","doi-asserted-by":"crossref","unstructured":"J. Akiyama and N. Alon.Disjoint simplices and geometric hypergraphs. Annals New York Academy of Science, pages 1\u20133, 1989.","DOI":"10.1111\/j.1749-6632.1989.tb22429.x"},{"key":"BF01994880_CR2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0022-0000(85)90065-0","volume":"31","author":"M. Atallah","year":"1985","unstructured":"M. Atallah.A matching problem in the plane. Journal of Computer and System Sciences, 31: 63\u201370, 1985.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01994880_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or.Lower bounds for algebraic computation trees. In Proceedings of the 15th ACM Symposium on Theory of Computing, pages 80\u201386, 1983.","DOI":"10.1145\/800061.808735"},{"key":"BF01994880_CR4","unstructured":"K. Q. Brown.Geometric Transforms for Fast Geometric Algorithms. PhD thesis, Carnegie-Mellon University, 1980."},{"issue":"4","key":"BF01994880_CR5","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TIT.1985.1057060","volume":"IT-31","author":"B. Chazelle","year":"1985","unstructured":"B. Chazelle.On the convex layers of a planar set. IEEE Transactions on Information Theory, IT-31 (4): 509\u2013517, July 1985.","journal-title":"IEEE Transactions on Information Theory"},{"key":"BF01994880_CR6","doi-asserted-by":"crossref","unstructured":"H. Edelsbrunner.Algorithms in Combinatorial Geometry, volume 10 ofEATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-61568-9"},{"key":"BF01994880_CR7","doi-asserted-by":"crossref","unstructured":"M. Fields and G. Frederickson.A faster algorithm for the maximum weighted tardiness problem. Manuscript, 1989.","DOI":"10.1016\/0020-0190(90)90184-Y"},{"key":"BF01994880_CR8","doi-asserted-by":"crossref","unstructured":"J. Friedman, J. Hershberger and J. Snoeyink.Compliant motion in a simple polygon. In Proceedings of the 5th ACM Symposium on Computational Geometry, pages 175\u2013186, 1989.","DOI":"10.1145\/73833.73854"},{"key":"BF01994880_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. Graham","year":"1972","unstructured":"R. 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":"1","key":"BF01994880_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195991000025","volume":"1","author":"L. Guibas","year":"1991","unstructured":"L. Guibas, J. Hershberger and J. Snoeyink.Compact interval trees: A data structure for convex hulls. International Journal of Computational Geometry & Applications, 1 (1): 1\u201322, 1991.","journal-title":"International Journal of Computational Geometry & Applications"},{"issue":"3","key":"BF01994880_CR11","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0196-6774(91)90013-O","volume":"12","author":"J. Hershberger","year":"1991","unstructured":"J. Hershberger and S. Suri.Finding tailored partitions. Journal of Algorithms, 12 (3): 431\u2013463, September 1991.","journal-title":"Journal of Algorithms"},{"key":"BF01994880_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(89)90126-9","volume":"31","author":"D. Hochbaum","year":"1989","unstructured":"D. Hochbaum and R. Shamir.An O log 2 n)algorithm for the maximum weighted tardiness problem. Information Processing Letters, 31: 215\u2013219, 1989.","journal-title":"Information Processing Letters"},{"key":"BF01994880_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0215021","volume":"15","author":"D. Kirkpatrick","year":"1986","unstructured":"D. Kirkpatrick and R. Seidel.The ultimate planar convex hull algorithm? SIAM Journal on Computing, 15: 287\u2013299, 1986.","journal-title":"SIAM Journal on Computing"},{"key":"BF01994880_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5498-0","volume-title":"Problem-Solving Through Problems","author":"L. C. Larson","year":"1983","unstructured":"L. C. Larson.Problem-Solving Through Problems. Springer-Verlag, New York, 1983."},{"key":"BF01994880_CR15","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"E. L. Lawler","year":"1973","unstructured":"E. L. Lawler,Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19: 544\u2013546, 1973.","journal-title":"Management Science"},{"key":"BF01994880_CR16","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. Overmars","year":"1981","unstructured":"M. Overmars and J. van Leeuwen.Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23: 166\u2013204, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01994880_CR17","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","volume":"22","author":"F. P. Preparata","year":"1979","unstructured":"F. P. Preparata.An optimal real time algorithm for planar convex hulls. Communications of the ACM, 22: 402\u2013405, 1979.","journal-title":"Communications of the ACM"},{"key":"BF01994880_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos.Computational Geometry. Springer-Verlag, New York, 1985."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994880.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01994880\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01994880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T00:59:45Z","timestamp":1683161985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01994880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF01994880"],"URL":"https:\/\/doi.org\/10.1007\/bf01994880","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}