{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:07:00Z","timestamp":1725494820366},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662792"},{"type":"electronic","value":"9783540484479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48447-7_16","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T16:42:14Z","timestamp":1194972134000},"page":"145-156","source":"Crossref","is-referenced-by-count":2,"title":["Testing the Quality of Manufactured Balls"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,18]]},"reference":[{"key":"16_CR1","unstructured":"P. Agarwal, B. Aronov, and M. Sharir. Line transversals of balls and smallest enclosing cylinder in three dimensions. In 8th ACM-SIAM Symposium on Data Structures and Algorithms (SODA), pages 483\u2013492, 1997."},{"key":"16_CR2","unstructured":"P. Bose and P. Morin. Testing the quality of manufactured balls. Technical Report TR-98-08, Carleton University School of Computer Science, 1998."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"P. Bose and P. Morin. Testing the quality of manufactured disks and cylinders. In Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC\u201998), pages 129\u2013138, 1998.","DOI":"10.1007\/3-540-49381-6_15"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0196-6774(87)90025-3","volume":"8","author":"R. Cole","year":"1987","unstructured":"R. Cole and C. K. Yap. Shape from probing. Journal of Algorithms, 8:19\u201338, 1987.","journal-title":"Journal of Algorithms"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"M. deBerg, P. Bose, D. Bremner, S. Ramaswami, and G. Wilfong. Computing constrained minimum-width annuli of point sets. In Proceedings of the 5th Workshop on Data Structures and Algorithms, pages 25\u201336, 1997.","DOI":"10.1007\/3-540-63307-3_77"},{"key":"16_CR6","unstructured":"C. A. Duncan, M. T. Goodrich, and E. A. Ramos. Efficient approximation and optimization algorithms for computational metrology. In 8th ACM-SIAM Symposium on Data Structures and Algorithms (SODA), pages 121\u2013130, 1997."},{"key":"16_CR7","unstructured":"H. Ebara, N. Fukuyama, H. Nakano, and Y. Nakanishi. Roundness algorithms using the Voronoi diagrams. In 1st Canadian Conference on Computational Geometry, page 41, 1989."},{"key":"16_CR8","unstructured":"Q. Fu and C. K. Yap. Computing near-centers in any dimension. Unpublished manuscript, 1998."},{"key":"16_CR9","unstructured":"J. Garcia and P. A. Ramos. Fitting a set of points by a circle. In ACM Symposium on Computational Geometry, 1997."},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/34.75510","volume":"13","author":"V. B. Le","year":"1991","unstructured":"V. B. Le and D. T. Lee. Out-of-roundness problem revisited. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(3):217\u2013223, 1991.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, T. Shermer, and C. Yap. A complete roundness classiffication procedure. In ACM Symposium on Computational Geometry, pages 129\u2013138, 1997.","DOI":"10.1145\/262839.262917"},{"key":"16_CR12","unstructured":"P. Ramos. Computing roundness in practice. In European Conference on Computational Geometry, pages 125\u2013126, 1997."},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0010-4485(92)90035-9","volume":"24","author":"U. Roy","year":"1992","unstructured":"U. Roy and X. Zhang. Establishment of a pair of concentric circles with the minimum radial separation for assessing rounding error. Computer Aided Design, 24(3):161\u2013168, 1992.","journal-title":"Computer Aided Design"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"E. Schomer, J. Sellen, M. Teichmann, and C. K. Yap. Efficient algorithms for the smallest enclosing cylinder. In 8th Canadian Conference on Computational Geometry, pages 264\u2013269, 1996.","DOI":"10.1145\/237218.237412"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"K. Swanson. An optimal algorithm for roundness determination on convex polygons. In Proceedings of the 3rd Workshop on Data Structures and Algorithms, pages 601\u2013609, 1993.","DOI":"10.1007\/3-540-57155-8_283"},{"key":"16_CR16","unstructured":"C. K. Yap. Exact computational geometry and tolerancing metrology. In David Avis and Jit Bose, editors, Snapshots of Computational and Discrete Geometry, Vol. 3. 1994."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48447-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:54:53Z","timestamp":1556952893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48447-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662792","9783540484479"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48447-7_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}