{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:37Z","timestamp":1725493657277},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_4","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T08:04:43Z","timestamp":1193472283000},"page":"20-29","source":"Crossref","is-referenced-by-count":0,"title":["Cylindrical Hierarchy for Deforming Necklaces"],"prefix":"10.1007","author":[{"given":"Sergei","family":"Bespamyatnikh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/PL00009427","volume":"21","author":"P. K. Agarwal","year":"1999","unstructured":"P. K. Agarwal, B. Aronov, and M. Sharir. Line traversals of balls and smallest enclosing cylinders in three dimensions. Discrete Comput. Geom., 21:373\u2013388, 1999.","journal-title":"Discrete Comput. Geom."},{"key":"4_CR2","unstructured":"P. K. Agarwal and C. M. Procopiuc. Approximation algorithms for projective clustering. In Proc. 11th ACM-SIAM Sympos. Discrete Algorithms, pp. 538\u2013547, 2000."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"T. Chan. Approximating the diameter, width, smallest enclosing cylinder and minimum-width annulus. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pp. 300\u2013309, 2000.","DOI":"10.1145\/336154.336216"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s004660050481","volume":"25","author":"S. De","year":"2000","unstructured":"S. De and K. J. Bathe. The method of finite spheres. Computational Mechanics, 25:329\u2013345, 2000.","journal-title":"Computational Mechanics"},{"key":"4_CR5","first-page":"2903","volume":"3","author":"L. Guibas","year":"2001","unstructured":"L. Guibas, F. Xie, and L. Zhang. Kinetic data structures for efficient simulation. In Proc. IEEE Intern. Conf. on Robotics and Automation, 3:2903\u20132910, 2001.","journal-title":"Proc. IEEE Intern. Conf. on Robotics and Automation"},{"key":"4_CR6","first-page":"191","volume-title":"Proc. Workshop Algorithmic Found. Robot.","author":"L. J. Guibas","year":"1998","unstructured":"L. J. Guibas. Kinetic data structures \u2014 a state of the art report. In P. K. Agarwal, L. E. Kavraki, and M. Mason, editors, Proc. Workshop Algorithmic Found. Robot., pp. 191\u2013209. A. K. Peters, Wellesley, MA, 1998."},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, A. Nguyen, D. Russel, and L. Zhang. Collision detection for deforming necklaces. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 33\u201342, 2002.","DOI":"10.1145\/513400.513405"},{"issue":"2","key":"4_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-7721(98)00023-6","volume":"11","author":"D. Halperin","year":"1998","unstructured":"D. Halperin and M. Overmars. Spheres, molecules, and hidden surface removal. Comput. Geom. Theory Appl., 11(2):83\u2013102, 1998.","journal-title":"Comput. Geom. Theory Appl."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"S. Har-Peled and K. Varadarajan. Projective clustering in high dimensions using core-sets. In Proc. 18th Annu. ACM Sympos. Comput. Geom., pp. 312\u2013318.","DOI":"10.1145\/513400.513440"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"V. Koltun and M. Sharir. The partition technique for overlays of envelopes. In Proc. 43nd Annu. IEEE Sympos. Found. Comput. Sci., pp. 637\u2013646.","DOI":"10.1109\/SFCS.2002.1181989"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo. Applying parallel computation algorithms in the design of serial algorithms. J. ACM, 30(4):852\u2013865, 1983.","journal-title":"J. ACM"},{"key":"4_CR12","unstructured":"S. Quinlan. Efficient distance computation between non-convex objects. pp. 3324\u20133329, 1994."},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s100510051009","volume":"12","author":"J. Sadoc","year":"1999","unstructured":"J. Sadoc and N. Rivier. Boerdijk-coxeter helix and biological helices. The European Physical Journal B, 12(2):309\u2013318, 1999.","journal-title":"The European Physical Journal B"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s004530010011","volume":"27","author":"E. Sch\u00f6mer","year":"2000","unstructured":"E. Sch\u00f6mer, J. Sellen, M. Teichmann, and C. K. Yap. Smallest enclosing cylinders. Algorithmica, 27(2):170\u2013186, 2000.","journal-title":"Algorithmica"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"B. Zhu. Approximating 3D points with cylindrical segments. In Proc. 8th Ann. Internat. Conf. Computing and Combinatorics, pp. 420\u2013429, 2002.","DOI":"10.1007\/3-540-45655-4_45"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T16:12:25Z","timestamp":1551024745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}