{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T17:05:52Z","timestamp":1779815152961,"version":"3.53.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.cad.2026.104098","type":"journal-article","created":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T16:13:26Z","timestamp":1779380006000},"page":"104098","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Accelerating Hausdorff distance computation between triangle meshes via spatial locality"],"prefix":"10.1016","volume":"198","author":[{"given":"Wenbo","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aizeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tao","family":"Ning","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cad.2026.104098_b1","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1111\/1467-8659.00236","article-title":"Metro: Measuring error on simplified surfaces","volume":"17","author":"Cignoni","year":"1998","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104098_b2","series-title":"Proceedings. IEEE international conference on multimedia and expo","first-page":"705","article-title":"MESH: Measuring errors between surfaces using the Hausdorff distance","volume":"vol. 1","author":"Aspert","year":"2002"},{"issue":"12","key":"10.1016\/j.cad.2026.104098_b3","doi-asserted-by":"crossref","first-page":"2560","DOI":"10.1109\/TVCG.2016.2632720","article-title":"Error-bounded and feature preserving surface remeshing with minimal angle improvement","volume":"23","author":"Hu","year":"2017","journal-title":"IEEE Trans Vis Comput Graphics"},{"key":"10.1016\/j.cad.2026.104098_b4","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.cagd.2018.03.017","article-title":"Fast and robust Hausdorff distance computation from triangle mesh to quad mesh in near-zero cases","volume":"62","author":"Kang","year":"2018","journal-title":"Comput Aided Geom Design"},{"key":"10.1016\/j.cad.2026.104098_b5","doi-asserted-by":"crossref","unstructured":"Garland M, Heckbert PS. Surface simplification using quadric error metrics. In: Proceedings of the 24th annual conference on computer graphics and interactive techniques. 1997, p. 209\u201316.","DOI":"10.1145\/258734.258849"},{"key":"10.1016\/j.cad.2026.104098_b6","series-title":"Proceedings of the seventh annual symposium on computational geometry","first-page":"186","article-title":"Approximate matching of polygonal shapes","author":"Alt","year":"1991"},{"issue":"8","key":"10.1016\/j.cad.2026.104098_b7","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/j.cagd.2010.04.004","article-title":"Precise Hausdorff distance computation between polygonal meshes","volume":"27","author":"Barton","year":"2010","journal-title":"Comput Aided Geom Design"},{"issue":"3","key":"10.1016\/j.cad.2026.104098_b8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1531326.1531380","article-title":"Interactive Hausdorff distance computation for general polygonal models","volume":"28","author":"Tang","year":"2009","journal-title":"ACM Trans Graph"},{"issue":"6","key":"10.1016\/j.cad.2026.104098_b9","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1007\/s00371-010-0477-3","article-title":"Precise Hausdorff distance computation for planar freeform curves using biarcs and depth buffer","volume":"26","author":"Kim","year":"2010","journal-title":"Vis Comput"},{"issue":"5","key":"10.1016\/j.cad.2026.104098_b10","doi-asserted-by":"crossref","DOI":"10.1111\/cgf.15129","article-title":"Cascading upper bounds for triangle soup Pompeiu\u2013Hausdorff distance","volume":"43","author":"Sacht","year":"2024","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104098_b11","series-title":"Thingi10k: A dataset of 10,000 3D-printing models","author":"Zhou","year":"2016"},{"key":"10.1016\/j.cad.2026.104098_b12","series-title":"2006 IEEE symposium on interactive ray tracing","first-page":"61","article-title":"On building fast kd-trees for ray tracing, and on doing that in O(N log N)","author":"Wald","year":"2006"},{"issue":"7","key":"10.1016\/j.cad.2026.104098_b13","doi-asserted-by":"crossref","DOI":"10.1111\/cgf.70229","article-title":"RT-HDIST: Ray-tracing core-based Hausdorff distance computation","volume":"44","author":"Kim","year":"2025","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104098_b14","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.patcog.2017.02.013","article-title":"A local start search algorithm to compute exact Hausdorff distance for arbitrary point sets","volume":"67","author":"Chen","year":"2017","journal-title":"Pattern Recognit"},{"issue":"3","key":"10.1016\/j.cad.2026.104098_b15","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1090\/S0002-9947-1959-0110078-1","article-title":"Curvature measures","volume":"93","author":"Federer","year":"1959","journal-title":"Trans Amer Math Soc"},{"key":"10.1016\/j.cad.2026.104098_b16","series-title":"Polygon Mesh Processing","author":"Botsch","year":"2010"},{"key":"10.1016\/j.cad.2026.104098_b17","series-title":"Eigen v3: A C++ template library for linear algebra","author":"Guennebaud","year":"2010"},{"key":"10.1016\/j.cad.2026.104098_b18","series-title":"libigl: A simple C++ geometry processing library","author":"Jacobson","year":"2018"},{"issue":"1","key":"10.1016\/j.cad.2026.104098_b19","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1111\/cgf.14395","article-title":"Economic upper bound estimation in Hausdorff distance computation for triangle meshes","volume":"41","author":"Zheng","year":"2022","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104098_b20","series-title":"trimesh: A python library for loading and using triangular meshes","author":"Dawson-Haggerty","year":"2019"},{"key":"10.1016\/j.cad.2026.104098_b21","first-page":"113645","article-title":"PyMeshLab: A python library for processing triangular meshes","volume":"9","author":"Muntoni","year":"2021","journal-title":"IEEE Access"},{"key":"10.1016\/j.cad.2026.104098_b22","doi-asserted-by":"crossref","unstructured":"Koch S, Matveev A, Jiang Z, Williams F, Artemov A, Burnaev E, Alexa M, Zorin D, Panozzo D. ABC: A Big CAD Model Dataset For Geometric Deep Learning. In: The IEEE conference on computer vision and pattern recognition. CVPR, 2019, p. 9601\u201311.","DOI":"10.1109\/CVPR.2019.00983"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448526000680?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448526000680?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,26]],"date-time":"2026-05-26T16:41:44Z","timestamp":1779813704000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448526000680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":22,"alternative-id":["S0010448526000680"],"URL":"https:\/\/doi.org\/10.1016\/j.cad.2026.104098","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Accelerating Hausdorff distance computation between triangle meshes via spatial locality","name":"articletitle","label":"Article Title"},{"value":"Computer-Aided Design","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cad.2026.104098","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104098"}}