{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T08:28:10Z","timestamp":1776846490612,"version":"3.51.2"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"6-8","license":[{"start":{"date-parts":[[2010,4,17]],"date-time":"2010-04-17T00:00:00Z","timestamp":1271462400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s00371-010-0477-3","type":"journal-article","created":{"date-parts":[[2010,4,16]],"date-time":"2010-04-16T12:38:46Z","timestamp":1271421526000},"page":"1007-1016","source":"Crossref","is-referenced-by-count":38,"title":["Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer"],"prefix":"10.1007","volume":"26","author":[{"given":"Yong-Joon","family":"Kim","sequence":"first","affiliation":[]},{"given":"Young-Taek","family":"Oh","sequence":"additional","affiliation":[]},{"given":"Seung-Hyun","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Myung-Soo","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Gershon","family":"Elber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,17]]},"reference":[{"key":"477_CR1","unstructured":"Lin, M.C., Gottschalk, S.: Collision detection between geometric models: a\u00a0survey. In: Proc. of IMA Conference on Mathematics of Surfaces, pp. 37\u201356 (1998)"},{"key":"477_CR2","first-page":"787","volume-title":"Handbook of Discrete and Computational Geometry","author":"M.C. Lin","year":"2004","unstructured":"Lin, M.C., Manocha, D.: Collision and proximity queries. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 787\u2013807. Chapman & Hall\/CRC, London (2004)","edition":"2"},{"key":"477_CR3","unstructured":"Johnson, D.: Minimum distance queries for haptic rendering. PhD thesis, Computer Science Department, University of Utah (2005)"},{"key":"477_CR4","volume-title":"Geometric Tools for Computer Graphics","author":"P. Schneider","year":"2003","unstructured":"Schneider, P., Eberley, D.: Geometric Tools for Computer Graphics. Morgan Kaufmann, San Francisco (2003)"},{"key":"477_CR5","volume-title":"Real-Time Collision Detection","author":"C. Ericson","year":"2005","unstructured":"Ericson, C.: Real-Time Collision Detection. Morgan Kaufmann, San Francisco (2005)"},{"key":"477_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/b10644","volume-title":"Real-Time Rendering","author":"T. Akenine-M\u00f6ller","year":"2008","unstructured":"Akenine-M\u00f6ller, T., Hains, E., Hoffman, N.: Real-Time Rendering, 3rd edn. AK Peters, Wellesley (2008)","edition":"3"},{"key":"477_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/56.2083","volume":"4","author":"E. Gilbert","year":"1988","unstructured":"Gilbert, E., Johnson, D., Keerthi, S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Trans. Robot. Autom. 4, 193\u2013203 (1988)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"477_CR8","doi-asserted-by":"crossref","unstructured":"Lin, M.C., Canny, J.: A fast algorithm for incremental distance calculation. In: IEEE Int. Conf. Robot. Autom., Sacramento, CA, pp. 1008\u20131014 (1991)","DOI":"10.1109\/ROBOT.1991.131723"},{"key":"477_CR9","doi-asserted-by":"crossref","unstructured":"Chung, K., Wang, W.: Quick collision detection of polytopes in virtual environments. In: ACM Symp. on Virtual Reality Software and Technology, Hong Kong, pp. 125\u2013131 (1996)","DOI":"10.1145\/3304181.3304206"},{"key":"477_CR10","doi-asserted-by":"crossref","unstructured":"Quinlan, S.: Efficient distance computation between non-convex objects. In: IEEE Int\u2019l Conf. on Robotics and Automation, pp. 3324\u20133329 (1994)","DOI":"10.1109\/ROBOT.1994.351059"},{"key":"477_CR11","unstructured":"Larsen, E., Gottschalk, S., Lin, M.C., Manocha, D.: Fast distance queries using rectangular swept sphere volumes. In: IEEE Int\u2019l Conf. on Robotics and Automation (2000)"},{"key":"477_CR12","unstructured":"Sohn, K.A., J\u00fcttler, B., Kim, M.-S., Wang, W.: Computing distances between surfaces using line geometry. In: Proc. of Pacific Graphics, pp. 236\u2013245 (2002)"},{"key":"477_CR13","doi-asserted-by":"crossref","unstructured":"Lennerz, C., Schomer, E.: Efficient distance computation for quadric curves and surfaces. In: Proc. of Geometric Modeling and Processing, pp. 60\u201369 (2002)","DOI":"10.1109\/GMAP.2002.1027497"},{"issue":"10","key":"477_CR14","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/S0010-4485(02)00123-9","volume":"35","author":"K.J. Kim","year":"2003","unstructured":"Kim, K.J.: Minimum distance between a canal surface and a simple surface. Comput Aided Des. 35(10), 871\u2013879 (2003)","journal-title":"Comput Aided Des."},{"key":"477_CR15","doi-asserted-by":"crossref","unstructured":"Rabl, M., J\u00fcttler, B.: Fast distance computation using quadratically supported surfaces. In: Proc. of Computational Kinematics (CK 2009), pp. 141\u2013148 (2009)","DOI":"10.1007\/978-3-642-01947-0_18"},{"issue":"10","key":"477_CR16","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/j.cad.2006.04.012","volume":"38","author":"X.-D. Chen","year":"2006","unstructured":"Chen, X.-D., Yong, J.-H., Zheng, G.-Q., Paul, J.-C., Sun, J.-G.: Computing minimum distance between two implicit algebraic surfaces. Comput. Aided Des. 38(10), 1053\u20131061 (2006)","journal-title":"Comput. Aided Des."},{"issue":"1","key":"477_CR17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.cam.2008.10.050","volume":"230","author":"X.-D. Chen","year":"2009","unstructured":"Chen, X.-D., Chen, L., Wang, Y., Xu, G., Yong, J.-H.: Computing the minimum distance between Bezier curves. J. Comput. Appl. Math. 230(1), 294\u2013310 (2009)","journal-title":"J. Comput. Appl. Math."},{"key":"477_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-79246-8_15","volume-title":"Advances in Geometric Modeling and Processing, Procs. of the 5th Int\u2019l Conf.","author":"G. Elber","year":"2008","unstructured":"Elber, G., Grandine, T.: Hausdorff and minimal distances between parametric freeforms in R 2 and R 3. In: Chen,\u00a0F., J\u00fcttler,\u00a0B. (eds.) Advances in Geometric Modeling and Processing, Procs. of the 5th Int\u2019l Conf., GMP 2008, Hangzhou, China, April 23\u201325, 2008. Lecture Notes in Computer Science, vol. 4975, pp. 191\u2013204. Springer, Berlin (2008)"},{"key":"477_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(83)90042-X","volume":"17","author":"M. Atallah","year":"1983","unstructured":"Atallah, M.: A linear time algorithm for the Hausdorff distance between convex polygons. Inf. Process. Lett. 17, 207\u2013209 (1983)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"477_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1111\/1467-8659.00236","volume":"17","author":"P. Cignoni","year":"1998","unstructured":"Cignoni, P., Rocchini, C., Scopigno, R.: Metro: Measuring error on simplified surfaces. Comput. Graph. Forum 17(2), 167\u2013174 (1998)","journal-title":"Comput. Graph. Forum"},{"key":"477_CR21","unstructured":"J\u00fcttler, B.: Bounding the Hausdorff distance of implicitly defined and\/or parametric curves. In: Mathematical methods in CAGD, Oslo 2000, pp. 1\u201310 (2000)"},{"key":"477_CR22","volume-title":"Handbook of Computational Geometry","author":"H. Alt","year":"1999","unstructured":"Alt, H., Guibas, L.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of Computational Geometry. Elsevier, Amsterdam (1999)"},{"key":"477_CR23","unstructured":"Alt, H., Scharf, L.: Computing the Hausdorff distance between sets of curves. In: Procs of the 20th European Workshop on Computational Geometry (EWCG), Seville, Spain, pp. 233\u2013236 (2004)"},{"issue":"4","key":"477_CR24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1142\/S0218195908002647","volume":"18","author":"H. Alt","year":"2008","unstructured":"Alt, H., Scharf, L.: Computing the Hausdorff distance between curved objects. Int. J. Comput. Geom. Appl. 18(4), 307\u2013320 (2008)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"477_CR25","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10589-005-4560-z","volume":"30","author":"B. Llanas","year":"2005","unstructured":"Llanas, B.: Efficient computation of the Hausdorff distance between polytopes by exterior random covering. Comput. Optim. Appl. 30, 161\u2013194 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"477_CR26","doi-asserted-by":"crossref","unstructured":"Tang, M., Lee, M., Kim, Y.J.: Interactive Hausdorff distance computation for general polygonal models. In: Proc. of SIGGRAPH\u201909. Computer graphics Annual Conference Series (2009)","DOI":"10.1145\/1576246.1531380"},{"key":"477_CR27","doi-asserted-by":"crossref","unstructured":"Barton, M., Hanniel, I., Elber, G., Kim, M.-S.: Precise Hausdorff distance computation between polygonal meshes. Computer Aided Geometric Design, accepted","DOI":"10.1016\/j.cagd.2010.04.004"},{"key":"477_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0015091","volume-title":"Efficient Visual Recognition using the Hausdorff Distance","author":"W. Rucklidge","year":"1996","unstructured":"Rucklidge, W.: Efficient Visual Recognition using the Hausdorff Distance. Lecture Notes in Computer Science, vol.\u00a01173. Springer, Berlin (1996)"},{"issue":"5","key":"477_CR29","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.cad.2008.08.008","volume":"41","author":"O. Aichholzer","year":"2009","unstructured":"Aichholzer, O., Aigner, W., Aurenhammer, F., Hackl, T., Oberneder, M., J\u00fcttler, B.: Medial axis computation for planar free-form shapes. Comput. Aided Des. 41(5), 339\u2013349 (2009)","journal-title":"Comput. Aided Des."},{"key":"477_CR30","doi-asserted-by":"crossref","unstructured":"Hoff, K., Culver, T., Keyser, J., Lin, M.C., Manocha, D.: Fast computation of generalized Voronoi diagrams using graphic hardware. In: Proc. of SIGGRAPH\u201999. Computer Graphics Annual Conference Series, pp. 277\u2013286 (1999)","DOI":"10.1145\/311535.311567"},{"key":"477_CR31","doi-asserted-by":"crossref","unstructured":"Eck, M., DeRose, T., Duchamp, T., Hoppey, H., Lounsbery, M., Stuetzle, W.: Multiresolution analysis of arbitrary meshes. In: ACM SIGGRAPH\u201995, Los Angeles, CA, pp. 173\u2013182 (1995)","DOI":"10.1145\/218380.218440"},{"key":"477_CR32","unstructured":"Alliez, P., Gotsman, C.: Isotropic remeshing of surfaces: a local parametrization approach. In: Proc. Int. Meshing Roundtable, pp.\u00a0215\u2013224 (2003)"},{"key":"477_CR33","doi-asserted-by":"crossref","unstructured":"Manocha, D., Erikson, C.: GAPS: General and automatic polygonal simplification. In: Proc. of ACM Symposium on Interactive 3D Graphics, pp. 79\u201388 (1998)","DOI":"10.1145\/300523.300532"},{"issue":"6","key":"477_CR34","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.cad.2006.02.003","volume":"38","author":"Z. Sir","year":"2006","unstructured":"Sir, Z., Feichtinger, R., J\u00fcttler, B.: Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics. Comput. Aided Des. 38(6), 608\u2013618 (2006)","journal-title":"Comput. Aided Des."},{"key":"477_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry","author":"F. Preparata","year":"1985","unstructured":"Preparata, F., Shamos, M.: Computational Geometry. Springer, New York (1985)"},{"key":"477_CR36","unstructured":"IRIT 10.0 User\u2019s Manual, Technion, 2009. http:\/\/www.cs.technion.ac.il\/~irit"},{"key":"477_CR37","doi-asserted-by":"crossref","unstructured":"Elber, G., Kim, M.-S.: Geometric constraint solver using multivariate rational spline functions. In: Proc. of the Sixth ACM Symposium on Solid Modeling and Applications, pp. 1\u201310 (2001)","DOI":"10.1145\/376957.376958"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-010-0477-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00371-010-0477-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-010-0477-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T01:24:53Z","timestamp":1740014693000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00371-010-0477-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,17]]},"references-count":37,"journal-issue":{"issue":"6-8","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["477"],"URL":"https:\/\/doi.org\/10.1007\/s00371-010-0477-3","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"value":"0178-2789","type":"print"},{"value":"1432-2315","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,17]]}}}