{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T18:01:47Z","timestamp":1780164107556,"version":"3.54.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["CCF-2317241"],"award-info":[{"award-number":["CCF-2317241"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s00454-025-00725-6","type":"journal-article","created":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T02:29:36Z","timestamp":1743388176000},"page":"1247-1265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["No-Dimensional Tverberg Partitions Revisited"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2638-9635","authenticated-orcid":false,"given":"Sariel","family":"Har-Peled","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1476-6715","authenticated-orcid":false,"given":"Eliot W.","family":"Robson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"725_CR1","doi-asserted-by":"publisher","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, Berlin, Germany (2002). https:\/\/doi.org\/10.1007\/978-1-4613-0039-7","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"1","key":"725_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01696777","volume":"37","author":"E Helly","year":"1930","unstructured":"Helly, E.: \u00dcber Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten. Monatsh. Math. Phys. 37(1), 281\u2013302 (1930). https:\/\/doi.org\/10.1007\/BF01696777","journal-title":"Monatsh. Math. Phys."},{"key":"725_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF02574382","volume":"12","author":"S Jadhav","year":"1994","unstructured":"Jadhav, S., Mukhopadhyay, A.: Computing a centerpoint of a finite planar set of points in linear time. Discrete Comput. Geom. 12, 291\u2013312 (1994). https:\/\/doi.org\/10.1007\/BF02574382","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"725_CR4","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1137\/21M1423324","volume":"51","author":"TM Chan","year":"2022","unstructured":"Chan, T.M., Har-Peled, S., Jones, M.: Optimal algorithms for geometric centers and depth. SIAM J. Comput. 51(3), 627\u2013663 (2022). https:\/\/doi.org\/10.1137\/21M1423324","journal-title":"SIAM J. Comput."},{"issue":"3","key":"725_CR5","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S021819599600023X","volume":"6","author":"KL Clarkson","year":"1996","unstructured":"Clarkson, K.L., Eppstein, D., Miller, G.L., Sturtivant, C., Teng, S.: Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6(3), 357\u2013377 (1996). https:\/\/doi.org\/10.1142\/S021819599600023X","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1","key":"725_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/3431285","volume":"17","author":"S Har-Peled","year":"2021","unstructured":"Har-Peled, S., Jones, M.: Journey to the center of the point set. ACM Trans. Algorithms 17(1), 9\u20131921 (2021). https:\/\/doi.org\/10.1145\/3431285","journal-title":"ACM Trans. Algorithms"},{"issue":"8","key":"725_CR7","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1016\/j.comgeo.2010.04.006","volume":"43","author":"GL Miller","year":"2010","unstructured":"Miller, G.L., Sheehy, D.R.: Approximate centerpoints with proofs. Comput. Geom. Theory Appl. 43(8), 647\u2013654 (2010). https:\/\/doi.org\/10.1016\/j.comgeo.2010.04.006","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"725_CR8","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/S00454-013-9528-7","volume":"50","author":"W Mulzer","year":"2013","unstructured":"Mulzer, W., Werner, D.: Approximating tverberg points in linear time for any fixed dimension. Discrete Comput. Geom. 50(2), 520\u2013535 (2013). https:\/\/doi.org\/10.1007\/S00454-013-9528-7","journal-title":"Discrete Comput. Geom."},{"key":"725_CR9","doi-asserted-by":"publisher","unstructured":"De\u00a0Loera, J.A., Goaoc, X., Meunier, F., Mustafa, N.H.: The discrete yet ubiquitous theorems of Carath\u00e9odory, Helly, Sperner, Tucker, and Tverberg. Bull. Amer. Math. Soc. (N.S.) 56(3), 415\u2013511 (2019). https:\/\/doi.org\/10.1090\/bull\/1653","DOI":"10.1090\/bull\/1653"},{"key":"725_CR10","doi-asserted-by":"publisher","unstructured":"B\u00e1r\u00e1ny, I., Sober\u00f3n, P.: Tverberg\u2019s theorem is 50 years old: a survey. Bull. Am. Math. Soc. (N.S.) 55(4), 459\u2013492 (2018). https:\/\/doi.org\/10.1090\/bull\/1634","DOI":"10.1090\/bull\/1634"},{"issue":"3","key":"725_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1006\/eujc.1993.1029","volume":"14","author":"H Tverberg","year":"1993","unstructured":"Tverberg, H., Vreica, S.: On generalizations of Radon\u2019s theorem and the ham sandwich theorem. Eur. J. Comb. 14(3), 259\u2013264 (1993). https:\/\/doi.org\/10.1006\/eujc.1993.1029","journal-title":"Eur. J. Comb."},{"key":"725_CR12","unstructured":"Rolnick, D., Sober\u00f3n, P.: Algorithms for Tverberg\u2019s theorem via centerpoint theorems. CoRR abs\/1601.03083 (2016) arXiv:1601.03083"},{"key":"725_CR13","doi-asserted-by":"publisher","unstructured":"Meunier, F., Mulzer, W., Sarrabezolles, P., Stein, Y.: The rainbow at the end of the line\u2014a PPAD formulation of the colorful carath\u00e9odory theorem with applications. In: Klein, P.N. (ed.) Proc. 28th ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 1342\u20131351. SIAM, Barcelona, Spain (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.87","DOI":"10.1137\/1.9781611974782.87"},{"issue":"4","key":"725_CR14","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1007\/s00454-022-00380-1","volume":"68","author":"A Choudhary","year":"2022","unstructured":"Choudhary, A., Mulzer, W.: No-dimensional Tverberg theorems and algorithms. Discrete Comput. Geom. 68(4), 964\u2013996 (2022). https:\/\/doi.org\/10.1007\/s00454-022-00380-1","journal-title":"Discrete Comput. Geom."},{"key":"725_CR15","doi-asserted-by":"publisher","unstructured":"Har-Peled, S., Zhou, T.: Improved approximation algorithms for Tverberg partitions. In: Mutzel, P., Pagh, R., Herman, G. (eds.) Proceedings of the 30th Annual European Symposium on Algorithms (ESA). LIPIcs, vol. 204, pp. 51\u201315115. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Wadern, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2021.51","DOI":"10.4230\/LIPIcs.ESA.2021.51"},{"issue":"2","key":"725_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00454-020-00172-5","volume":"64","author":"KA Adiprasito","year":"2020","unstructured":"Adiprasito, K.A., B\u00e1r\u00e1ny, I., Mustafa, N.H., Terpai, T.: Theorems of Carath\u00e9odory, Helly, and Tverberg without dimension. Discrete Comput. Geom. 64(2), 233\u2013258 (2020). https:\/\/doi.org\/10.1007\/s00454-020-00172-5","journal-title":"Discrete Comput. Geom."},{"key":"725_CR17","doi-asserted-by":"publisher","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering (extended abstract). In: Mehlhorn, K. (ed.) Proceedings of the 10th Annual Symposium on Computational Geometry (SoCG), pp. 332\u2013339. ACM, New York, NY, USA (1994). https:\/\/doi.org\/10.1145\/177424.178042","DOI":"10.1145\/177424.178042"},{"key":"725_CR18","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the frank-wolfe algorithm. In: Teng, S. (ed.) Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms. (SODA), pp. 922\u2013931. SIAM, Philadelphia, PA, USA (2008). http:\/\/dl.acm.org\/citation.cfm?id=1347082.1347183"},{"key":"725_CR19","doi-asserted-by":"publisher","unstructured":"Matou\u0161ek, J.: Geometric Discrepancy. Algorithms and Combinatorics, vol. 18. Springer, Berlin, Germany (1999). https:\/\/doi.org\/10.1007\/978-3-642-03942-3. http:\/\/kam.mff.cuni.cz\/~matousek\/dg.html","DOI":"10.1007\/978-3-642-03942-3"},{"key":"725_CR20","unstructured":"Chazelle, B.: The Discrepancy Method: Randomness and Complexity. Cambridge University Press, New York (2001). http:\/\/www.cs.princeton.edu\/~chazelle\/book.html"},{"key":"725_CR21","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S0963548300000225","volume":"1","author":"N Alon","year":"1992","unstructured":"Alon, N., B\u00e1r\u00e1ny, I., F\u00fcredi, Z., Kleitman, D.J.: Point selections and weak $$\\varepsilon $$-nets for convex hulls. Comb. Probab. Comput. 1, 189\u2013200 (1992). https:\/\/doi.org\/10.1017\/S0963548300000225","journal-title":"Comb. Probab. Comput."},{"key":"725_CR22","doi-asserted-by":"publisher","unstructured":"Chen, Y., Mairal, J., Harchaoui, Z.: Fast and robust archetypal analysis for representation learning. In: Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1478\u20131485. IEEE Computer Society, USA (2014). https:\/\/doi.org\/10.1109\/CVPR.2014.192","DOI":"10.1109\/CVPR.2014.192"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00725-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00725-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00725-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T17:48:45Z","timestamp":1780163325000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00725-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["725"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00725-6","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,28]]},"assertion":[{"value":"6 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}