{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T04:06:46Z","timestamp":1751947606810,"version":"3.41.2"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T00:00:00Z","timestamp":1748131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Vis Comput"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s00371-025-03978-7","type":"journal-article","created":{"date-parts":[[2025,5,25]],"date-time":"2025-05-25T02:49:57Z","timestamp":1748141397000},"page":"6795-6807","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ConDT: A 2D curve reconstruction algorithm based on a constrained neighbor proximity graph"],"prefix":"10.1007","volume":"41","author":[{"given":"J.","family":"Antony","sequence":"first","affiliation":[]},{"given":"M.","family":"Reghunath","sequence":"additional","affiliation":[]},{"given":"S. B.","family":"Thayyil","sequence":"additional","affiliation":[]},{"given":"R.","family":"Muthuganapathy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,25]]},"reference":[{"key":"3978_CR1","doi-asserted-by":"crossref","unstructured":"Amenta, N., Bern, M., Eppstein, D.: The crust and the beta-skeleton: Combinatorial curve reconstruction. Graph. Models Image Process. 125\u2013135 (1998)","DOI":"10.1006\/gmip.1998.0465"},{"key":"3978_CR2","doi-asserted-by":"crossref","unstructured":"Amenta, N., Choi, S., Kolluri, R. K.: The power crust. In: Proceedings of the Sixth ACM Symposium on Solid Modeling and Applications, SMA \u201901, pp. 249\u2013266. ACM (2001)","DOI":"10.1145\/376957.376986"},{"issue":"6","key":"3978_CR3","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1016\/j.rcim.2008.03.007","volume":"24","author":"T An Nguyen","year":"2008","unstructured":"An Nguyen, T., Zeng, Y.: Vicur: A human-vision-based algorithm for curve reconstruction. Robot. Comput.-Integr. Manuf. 24(6), 824\u2013834 (2008)","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"3978_CR4","doi-asserted-by":"publisher","first-page":"4805","DOI":"10.1007\/s00371-024-03477-1","volume":"40","author":"S Barzegar Khalilsaraei","year":"2024","unstructured":"Barzegar Khalilsaraei, S., Komar, A., Zheng, J., et al.: Inceptcurves: Curve reconstruction using an inception network. Vis. Comput. 40, 4805\u20134815 (2024)","journal-title":"Vis. Comput."},{"issue":"1","key":"3978_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.comgeo.2004.07.004","volume":"31","author":"SW Cheng","year":"2005","unstructured":"Cheng, S.W., Funke, S., Golin, M., Kumar, P., Poon, S.H., Ramos, E.: Curve reconstruction from noisy samples. Comput. Geom. 31(1), 63\u2013100 (2005)","journal-title":"Comput. Geom."},{"key":"3978_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1142\/S0218195902000931","volume":"12","author":"T Dey","year":"2002","unstructured":"Dey, T., Wenger, R.: Fast reconstruction of curves with sharp corners. Int. J. Comput. Geometry Appl. 12, 353\u2013400 (2002)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"3978_CR7","unstructured":"Dey, T.K., Kumar, P.: A simple provable algorithm for curve reconstruction. In: SODA \u201999, pp. 893\u2013894 (1999)"},{"issue":"4","key":"3978_CR8","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0925-7721(99)00051-6","volume":"15","author":"TK Dey","year":"2000","unstructured":"Dey, T.K., Mehlhorn, K., Ramos, E.A.: Curve reconstruction: Connecting dots with good reason. Comput. Geom. 15(4), 229\u2013244 (2000)","journal-title":"Comput. Geom."},{"issue":"2","key":"3978_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/S0925-7721(01)00015-3","volume":"19","author":"TK Dey","year":"2001","unstructured":"Dey, T.K., Wenger, R.: Reconstructing curves with sharp corners. Comput. Geom. 19(2), 89\u201399 (2001). (Combinatorial Curves and Surfaces)","journal-title":"Comput. Geom."},{"issue":"10","key":"3978_CR10","doi-asserted-by":"publisher","first-page":"3224","DOI":"10.1016\/j.patcog.2008.03.023","volume":"41","author":"M Duckham","year":"2008","unstructured":"Duckham, M., Kulik, L., Worboys, M.F., Galton, A.: Efficient generation of simple polygons for characterizing the shape of a set of points in the plane. Pattern Recogn. 41(10), 3224\u20133236 (2008)","journal-title":"Pattern Recogn."},{"issue":"1","key":"3978_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/174462.156635","volume":"13","author":"H Edelsbrunner","year":"1994","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Three-dimensional alpha shapes. ACM Trans. Graph. 13(1), 43\u201372 (1994)","journal-title":"ACM Trans. Graph."},{"issue":"3","key":"3978_CR12","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.acha.2011.02.001","volume":"31","author":"M Feiszli","year":"2011","unstructured":"Feiszli, M., Jones, P.W.: Curve denoising by multiscale singularity detection and geometric shrinkage. Appl. Comput. Harmon. Anal. 31(3), 392\u2013409 (2011)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"3978_CR13","doi-asserted-by":"crossref","unstructured":"de\u00a0Goes, F., Cohen-Steiner, D., Alliez, P., Desbrun, M.: An optimal transport approach to robust reconstruction and simplification of 2d shapes. Comput. Graph. Forum (2011)","DOI":"10.1111\/j.1467-8659.2011.02033.x"},{"key":"3978_CR14","doi-asserted-by":"crossref","unstructured":"Han, J., Kamber, M., Pei, J.: 2 - getting to know your data. In: J.\u00a0Han, M.\u00a0Kamber, J.\u00a0Pei (eds.) Data Mining (Third Edition), The Morgan Kaufmann Series in Data Management Systems, 3rd edition, pp. 39\u201382. Morgan Kaufmann, Boston (2012)","DOI":"10.1016\/B978-0-12-381479-1.00002-2"},{"issue":"2","key":"3978_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0167-8396(99)00044-8","volume":"17","author":"IK Lee","year":"2000","unstructured":"Lee, I.K.: Curve reconstruction from unorganized points. Comput.-Aided Geom. Des. 17(2), 161\u2013177 (2000)","journal-title":"Comput.-Aided Geom. Des."},{"key":"3978_CR16","unstructured":"Lenz, T.: How to sample and reconstruct curves with unusual features. In: Proceedings of the 22nd European Workshop on Computational Geometry (EWCG), pp. 3, 8, 12, 16, 20. Delphi, Greece (2006)"},{"issue":"7","key":"3978_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1111\/cgf.14654","volume":"41","author":"D Marin","year":"2022","unstructured":"Marin, D., Ohrhallinger, S., Wimmer, M.: SIGDT: 2D curve reconstruction. Comput. Graph. Forum 41(7), 25\u201336 (2022)","journal-title":"Comput. Graph. Forum"},{"key":"3978_CR18","doi-asserted-by":"crossref","unstructured":"Mehra, R., Tripathi, P., Sheffer, A., Mitra, N.J.: Visibility of noisy point cloud data. Computers and Graphics (2010). In Press, Accepted Manuscript","DOI":"10.1016\/j.cag.2010.03.002"},{"key":"3978_CR19","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cag.2017.05.006","volume":"66","author":"S Methirumangalath","year":"2017","unstructured":"Methirumangalath, S., Kannan, S.S., Parakkat, A.D., Muthuganapathy, R.: Hole detection in a planar point set: An empty disk approach. Comput. Graph. 66, 124\u2013134 (2017)","journal-title":"Comput. Graph."},{"key":"3978_CR20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.cag.2015.05.025","volume":"51","author":"S Methirumangalath","year":"2015","unstructured":"Methirumangalath, S., Parakkat, A.D., Muthuganapathy, R.: A unified approach towards reconstruction of a planar point set. Comput. Graph. 51, 90\u201397 (2015)","journal-title":"Comput. Graph."},{"issue":"5","key":"3978_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1111\/cgf.12973","volume":"35","author":"S Ohrhallinger","year":"2016","unstructured":"Ohrhallinger, S., Mitchell, S., Wimmer, M.: Curve reconstruction with many fewer samples. Comput. Graph. Forum 35(5), 167\u2013176 (2016)","journal-title":"Comput. Graph. Forum"},{"issue":"8","key":"3978_CR22","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1111\/cgf.12162","volume":"32","author":"S Ohrhallinger","year":"2013","unstructured":"Ohrhallinger, S., Mudur, S.: An efficient algorithm for determining an aesthetic shape connecting unorganized 2d points. Comput. Graph. Forum 32(8), 72\u201388 (2013)","journal-title":"Comput. Graph. Forum"},{"key":"3978_CR23","unstructured":"Ohrhallinger, S., Parakkat, A.D., Memari, P.: Feature-Sized Sampling for Vector Line Art. In: Pacific Graphics Short Papers and Posters. The Eurographics Association (2023)"},{"key":"3978_CR24","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1111\/cgf.142659","volume":"40","author":"S Ohrhallinger","year":"2021","unstructured":"Ohrhallinger, S., Peethambaran, J., Parakkat, A., Dey, T., Muthuganapathy, R.: 2D points curve reconstruction survey and benchmark. Comput. Graph. Forum 40, 611\u2013632 (2021)","journal-title":"Comput. Graph. Forum"},{"key":"3978_CR25","unstructured":"Ohrhallinger, S., Wimmer, M.: Stretchdenoise: parametric curve reconstruction with guarantees by separating connectivity from residual uncertainty of samples. In: Proceedings of the 26th Pacific Conference on Computer Graphics and Applications: Short Papers, PG \u201918, p. 1-4. Eurographics Association, Goslar, DEU (2018)"},{"issue":"1","key":"3978_CR26","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1111\/cgf.13395","volume":"38","author":"S Ohrhallinger","year":"2019","unstructured":"Ohrhallinger, S., Wimmer, M.: Fitconnect: Connecting noisy 2d samples by fitted neighbourhoods. Comput. Graph. Forum 38(1), 126\u2013137 (2019)","journal-title":"Comput. Graph. Forum"},{"key":"3978_CR27","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cag.2018.05.015","volume":"74","author":"AD Parakkat","year":"2018","unstructured":"Parakkat, A.D., Methirumangalath, S., Muthuganapathy, R.: Peeling the longest: A simple generalized curve reconstruction algorithm. Comput. Graph. 74, 191\u2013201 (2018)","journal-title":"Comput. Graph."},{"key":"3978_CR28","doi-asserted-by":"crossref","unstructured":"Parakkat, A.D., Muthuganapathy, R.: Crawl through neighbors: A simple curve reconstruction algorithm. Comput. Graph. Forum (2016)","DOI":"10.1111\/cgf.12974"},{"key":"3978_CR29","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.cad.2014.12.002","volume":"62","author":"J Peethambaran","year":"2015","unstructured":"Peethambaran, J., Muthuganapathy, R.: A non-parametric approach to shape reconstruction from planar point sets through delaunay filtering. Comput. Aided Des. 62, 164\u2013175 (2015)","journal-title":"Comput. Aided Des."},{"key":"3978_CR30","unstructured":"The CGAL Project: CGAL User and Reference Manual, 5.6 edn. CGAL Editorial Board (2023). https:\/\/doc.cgal.org\/5.6\/Manual\/packages.html"},{"key":"3978_CR31","doi-asserted-by":"crossref","unstructured":"Wang, J., Yu, Z., Zhang, W., Wei, M., Tan, C., Dai, N., Wei, L.: Robust reconstruction of 2d curves from scattered noisy point data. Comput.-Aided Des. 50 (2014)","DOI":"10.1016\/j.cad.2014.01.003"},{"key":"3978_CR32","doi-asserted-by":"crossref","unstructured":"Zeng, Y., Nguyen, T.A., Yan, B., Li, S.: A distance-based parameter free algorithm for curve reconstruction. Comput. Aided Des. 40(2), 210\u2013222 (2008)","DOI":"10.1016\/j.cad.2007.10.010"}],"container-title":["The Visual Computer"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-025-03978-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00371-025-03978-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00371-025-03978-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T11:02:47Z","timestamp":1751886167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00371-025-03978-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,25]]},"references-count":32,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["3978"],"URL":"https:\/\/doi.org\/10.1007\/s00371-025-03978-7","relation":{},"ISSN":["0178-2789","1432-2315"],"issn-type":[{"type":"print","value":"0178-2789"},{"type":"electronic","value":"1432-2315"}],"subject":[],"published":{"date-parts":[[2025,5,25]]},"assertion":[{"value":"28 April 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}