{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:08:06Z","timestamp":1760238486926,"version":"build-2065373602"},"reference-count":22,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1525978 and CCF-1652218"],"award-info":[{"award-number":["CCF-1525978 and CCF-1652218"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>We generalize the local-feature size definition of adaptive sampling used in surface reconstruction to relate it to an alternative metric on Euclidean space. In the new metric, adaptive samples become uniform samples, making it simpler both to give adaptive sampling versions of homological inference results and to prove topological guarantees using the critical points theory of distance functions. This ultimately leads to an algorithm for homology inference from samples whose spacing depends on their distance to a discrete representation of the complement space.<\/jats:p>","DOI":"10.3390\/a13080200","type":"journal-article","created":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T11:15:27Z","timestamp":1597749327000},"page":"200","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Metrics for Adaptive Samples"],"prefix":"10.3390","volume":"13","author":[{"given":"Nicholas J.","family":"Cavanna","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269, USA"},{"name":"Swift Health Systems Inc., Irvine, CA 92617, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9177-2713","authenticated-orcid":false,"given":"Donald R.","family":"Sheehy","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269, USA"},{"name":"Department of Computer Science, North Carolina State University, Raleigh, NC 27695, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00371-006-0027-1","article-title":"The conformal alpha shape filtration","volume":"22","author":"Cazals","year":"2006","journal-title":"Vis. Comput."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/j.comgeo.2007.07.001","article-title":"Smooth Manifold Reconstruction from Noisy and Non-Uniform Approximation with Guarantees","volume":"40","author":"Chazal","year":"2008","journal-title":"Comput. Geom. Theory Appl."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Chazal, F., and Lieutier, A. (2006, January 5\u20137). Topology Guaranteeing Manifold Reconstruction using Distance Function to Noisy Data. Proceedings of the 22nd ACM Symposium on Computational Geometry, Sedona, AZ, USA.","DOI":"10.1145\/1137856.1137876"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Dey, T.K., Dong, Z., and Wang, Y. (2017, January 16\u201319). Parameter-free topology inference and sparsification for data on manifolds. Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain.","DOI":"10.1137\/1.9781611974782.181"},{"key":"ref_5","unstructured":"Amenta, N., Bern, M., and Kamvysselis, M. (2013, January 21\u201325). A new Voronoi-based surface reconstruction algorithm. Proceedings of the 25th Annual Conference on Computer Graphics and Interactive Techniques, Anaheim, CA, USA."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dey, T.K. (2007). Curve and Surface Reconstruction: Algorithms with Mathematical Analysis, Cambridge University Press.","DOI":"10.1017\/CBO9780511546860"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10208-017-9344-1","article-title":"Delaunay Triangulation of Manifolds","volume":"18","author":"Boissonnat","year":"2018","journal-title":"Found. Comput. Math."},{"key":"ref_8","first-page":"20:1","article-title":"The Topological Correctness of PL-Approximations of Isomanifolds","volume":"Volume 164","author":"Cabello","year":"2020","journal-title":"Proceedings of the 36th International Symposium on Computational Geometry (SoCG 2020)"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s00454-008-9053-2","article-title":"Finding the Homology of Submanifolds with High Confidence from Random Samples","volume":"39","author":"Niyogi","year":"2008","journal-title":"Discret. Comput. Geom."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1137\/090762932","article-title":"A Topological View of Unsupervised Learning from Noisy Data","volume":"40","author":"Niyogi","year":"2011","journal-title":"SIAM J. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1090\/pspum\/054.3\/1216630","article-title":"Critical point theory for distance functions","volume":"54","author":"Grove","year":"1993","journal-title":"Proc. Symp. Pure Math."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00454-009-9144-8","article-title":"A Sampling Theory for Compact Sets in Euclidean Space","volume":"41","author":"Chazal","year":"2009","journal-title":"Discret. Comput. Geom."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L. (2006, January 21\u201323). Building triangulations using \u03b5-nets. Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, Seattle, WA, USA.","DOI":"10.1145\/1132516.1132564"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"1213","DOI":"10.1177\/0278364908097213","article-title":"Planning High-quality Paths and Corridors Amidst Obstacles","volume":"27","author":"Wein","year":"2008","journal-title":"Int. J. Robot. Res."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Fox, K., and Salzman, O. (2016, January 10\u201312). An efficient algorithm for computing high quality paths amid polygonal obstacles. Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, VA, USA.","DOI":"10.1137\/1.9781611974331.ch82"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Cohen, M.B., Fasy, B.T., Miller, G.L., Nayyeri, A., Sheehy, D.R., and Velingker, A. (2015, January 5\u20137). Approximating Nearest Neighbor Distances. Proceedings of the Algorithms and Data Structures Symposium, Victoria, BC, Canada.","DOI":"10.1007\/978-3-319-21840-3_17"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Chu, T., Miller, G.L., and Sheehy, D.R. (2020, January 5\u20138). Exact computation of a manifold metric via Lipschitz Embeddings and Shortest Paths on a Graph. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, Salt Lake City, UT, USA.","DOI":"10.1137\/1.9781611975994.25"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"47","DOI":"10.24033\/asens.1361","article-title":"C\u221e approximations of convex, subharmonic, and plurisubharmonic functions","volume":"12","author":"Green","year":"1979","journal-title":"Ann. Sci. \u00c9c. Norm. Sup."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Chazal, F., and Lieutier, A. (2005, January 6\u20138). Weak Feature Size and Persistent Homology: Computing Homology of Solids in Rn from Noisy Data Samples. Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy.","DOI":"10.1145\/1064092.1064132"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Chazal, F., and Oudot, S.Y. (2008, January 9\u201311). Towards Persistence-Based Reconstruction in Euclidean Spaces. Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA.","DOI":"10.1145\/1377676.1377719"},{"key":"ref_21","unstructured":"Hatcher, A. (2001). Algebraic Topology, Cambridge University Press."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s00454-002-2885-2","article-title":"Topological Persistence and Simplification","volume":"4","author":"Edelsbrunner","year":"2002","journal-title":"Discret. Comput. Geom."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/8\/200\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:02:26Z","timestamp":1760176946000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/13\/8\/200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,18]]},"references-count":22,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2020,8]]}},"alternative-id":["a13080200"],"URL":"https:\/\/doi.org\/10.3390\/a13080200","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2020,8,18]]}}}