{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:54:19Z","timestamp":1775325259644,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T00:00:00Z","timestamp":1768608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T00:00:00Z","timestamp":1768608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001839","name":"University Grants Committee","doi-asserted-by":"publisher","award":["610012"],"award-info":[{"award-number":["610012"]}],"id":[{"id":"10.13039\/501100001839","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-CE48-0005"],"award-info":[{"award-number":["ANR-19-CE48-0005"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1618866"],"award-info":[{"award-number":["CCF-1618866"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["16213219"],"award-info":[{"award-number":["16213219"]}],"id":[{"id":"10.13039\/100000001","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,4]]},"abstract":"Abstract<\/jats:title>\n \n Approximating convex bodies is a fundamental problem in geometry. Given a convex body\n K<\/jats:italic>\n in\n \n \n $$\\mathbb {R}^d$$<\/jats:tex-math>\n \n \n \n R<\/mml:mi>\n <\/mml:mrow>\n d<\/mml:mi>\n <\/mml:msup>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n for a fixed dimension\n d<\/jats:italic>\n , the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff error\n \n \n $$\\varepsilon $$<\/jats:tex-math>\n \n \u03b5<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . The best known uniform bound, due to Dudley (1974), shows that\n \n \n $$O(({{\\,\\textrm{diam}\\,}}(K)\/\\varepsilon )^{(d-1)\/2})$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n \n (<\/mml:mo>\n \n \n diam<\/mml:mtext>\n \n <\/mml:mrow>\n \n (<\/mml:mo>\n K<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n \/<\/mml:mo>\n \u03b5<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n \n (<\/mml:mo>\n d<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n )<\/mml:mo>\n \/<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n facets suffice. Although this bound is optimal for fat objects, such as Euclidean balls, it is far from optimal for \u201cskinny\u201d convex bodies. Skinniness can be characterized relative to the Euclidean ball. Given a convex body\n K<\/jats:italic>\n , define its\n area radius<\/jats:italic>\n ,\n \n \n $${{\\,\\textrm{arad}\\,}}(K)$$<\/jats:tex-math>\n \n \n \n \n arad<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n K<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , to be the radius of the Euclidean ball having the same surface area as\n K<\/jats:italic>\n . It follows from generalizations of the isoperimetric inequality that\n \n \n $${{\\,\\textrm{diam}\\,}}(K) \\ge 2 \\cdot {{\\,\\textrm{arad}\\,}}(K)$$<\/jats:tex-math>\n \n \n \n \n diam<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n K<\/mml:mi>\n )<\/mml:mo>\n \u2265<\/mml:mo>\n 2<\/mml:mn>\n \u00b7<\/mml:mo>\n \n \n arad<\/mml:mtext>\n \n <\/mml:mrow>\n (<\/mml:mo>\n K<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . We show that, given a convex body whose minimum width is at least\n \n \n $$\\varepsilon $$<\/jats:tex-math>\n \n \u03b5<\/mml:mi>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n , it is possible to approximate the body by a polytope having\n \n \n $$O(({{\\,\\textrm{arad}\\,}}(K)\/\\varepsilon )^{(d-1)\/2})$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n \n (<\/mml:mo>\n \n \n arad<\/mml:mtext>\n \n <\/mml:mrow>\n \n (<\/mml:mo>\n K<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n \/<\/mml:mo>\n \u03b5<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n \n (<\/mml:mo>\n d<\/mml:mi>\n -<\/mml:mo>\n 1<\/mml:mn>\n )<\/mml:mo>\n \/<\/mml:mo>\n 2<\/mml:mn>\n <\/mml:mrow>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n facets. Our approach works by first reducing the problem of approximating convex bodies to that of approximating convex functions. We employ a classical concept from convexity, called Macbeath regions. We demonstrate that there is a polar relationship between the Macbeath regions of a function and the Macbeath regions of its Legendre dual. This is combined with known bounds on the Mahler volume to bound the total size of the approximation.\n <\/jats:p>","DOI":"10.1007\/s00454-025-00815-5","type":"journal-article","created":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T17:34:51Z","timestamp":1768671291000},"page":"709-746","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Area-Sensitive Bounds for Polytope Approximation"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0939-4192","authenticated-orcid":false,"given":"Sunil","family":"Arya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9807-028X","authenticated-orcid":false,"given":"Guilherme D.","family":"da Fonseca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3290-8932","authenticated-orcid":false,"given":"David M.","family":"Mount","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,17]]},"reference":[{"key":"815_CR1","doi-asserted-by":"publisher","unstructured":"Abdelkader, A., Arya, S., da\u00a0Fonseca, G.\u00a0D., Mount, D.\u00a0M.: Approximate nearest neighbor searching with non-Euclidean and weighted distances. In: Proc. 30th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 355\u2013372, (2019). https:\/\/doi.org\/10.1137\/1.9781611975482.23","DOI":"10.1137\/1.9781611975482.23"},{"key":"815_CR2","doi-asserted-by":"publisher","unstructured":"Alon, N., Haussler, D., Welzl, E.: Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension. In: Proc. Third Annu. Sympos. Comput. Geom., pp. 331\u2013340, (1987). https:\/\/doi.org\/10.1145\/41958.41994","DOI":"10.1145\/41958.41994"},{"key":"815_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3559106","volume":"18","author":"R Arya","year":"2022","unstructured":"Arya, R., Arya, S., da Fonseca, G.D., Mount, D.M.: Optimal bound on the combinatorial complexity of approximating polytopes. ACM Trans. Algorithms 18, 1\u201329 (2022). https:\/\/doi.org\/10.1145\/3559106","journal-title":"ACM Trans. Algorithms"},{"key":"815_CR4","doi-asserted-by":"publisher","unstructured":"Arya, S., da\u00a0Fonseca, G.\u00a0D., Mount, D.\u00a0M.: Polytope approximation and the Mahler volume. In: Proc. 23rd Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 29\u201342, (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.3","DOI":"10.1137\/1.9781611973099.3"},{"key":"815_CR5","doi-asserted-by":"publisher","unstructured":"Arya, S., da\u00a0Fonseca, G.\u00a0D., Mount, D.\u00a0M.: Near-optimal $$\\varepsilon $$-kernel construction and related problems. In: Proc. 33rd Internat. Sympos. Comput. Geom., pp. 10:1\u201315, (2017). arxiv:1703.10868, https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.10","DOI":"10.4230\/LIPIcs.SoCG.2017.10"},{"issue":"4","key":"815_CR6","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1007\/s00454-016-9856-5","volume":"58","author":"S Arya","year":"2017","unstructured":"Arya, S., da Fonseca, G.D., Mount, D.M.: On the combinatorial complexity of approximating polytopes. Discrete Comput. Geom. 58(4), 849\u2013870 (2017). https:\/\/doi.org\/10.1007\/s00454-016-9856-5","journal-title":"Discrete Comput. Geom."},{"key":"815_CR7","doi-asserted-by":"publisher","unstructured":"Arya, S., da\u00a0Fonseca, G.\u00a0D., Mount, D.\u00a0M.: Optimal approximate polytope membership. In Proc. 28th Annu. ACM-SIAM Sympos. Discrete Algorithms, pp. 270\u2013288, (2017). https:\/\/doi.org\/10.1137\/1.9781611974782.18","DOI":"10.1137\/1.9781611974782.18"},{"issue":"4","key":"815_CR8","doi-asserted-by":"publisher","first-page":"1002","DOI":"10.1137\/23M1568351","volume":"53","author":"S Arya","year":"2024","unstructured":"Arya, S., da Fonseca, G.D., Mount, D.M.: Economical convex coverings and applications. SIAM J. Comput. 53(4), 1002\u20131038 (2024). https:\/\/doi.org\/10.1137\/23M1568351","journal-title":"SIAM J. Comput."},{"key":"815_CR9","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/s00454-009-9140-z","volume":"41","author":"S Arya","year":"2009","unstructured":"Arya, S., Malamatos, T., Mount, D.M.: The effect of corners on the complexity of approximate range searching. Discrete Comput. Geom. 41, 398\u2013443 (2009). https:\/\/doi.org\/10.1007\/s00454-009-9140-z","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"815_CR10","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s00454-025-00780-z","volume":"74","author":"S Arya","year":"2025","unstructured":"Arya, S., Mount, D.M.: Optimal volume-sensitive bounds for polytope approximation. Discrete Comput. Geom. 74(4), 839\u2013871 (2025). https:\/\/doi.org\/10.1007\/s00454-025-00780-z","journal-title":"Discrete Comput. Geom."},{"key":"815_CR11","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00454-012-9412-x","volume":"47","author":"S Arya","year":"2012","unstructured":"Arya, S., Mount, D.M., Xia, J.: Tight lower bounds for halfspace range searching. Discrete Comput. Geom. 47, 711\u2013730 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9412-x","journal-title":"Discrete Comput. Geom."},{"key":"815_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1006\/aima.1999.1904","volume":"153","author":"K B\u00f6r\u00f6czky Jr","year":"2000","unstructured":"B\u00f6r\u00f6czky, K., Jr.: Approximation of general smooth convex bodies. Adv. Math. 153, 325\u2013341 (2000). https:\/\/doi.org\/10.1006\/aima.1999.1904","journal-title":"Adv. Math."},{"issue":"2","key":"815_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1112\/jlms\/s2-44.2.351","volume":"44","author":"K Ball","year":"1991","unstructured":"Ball, K.: Volume ratios and a reverse isoperimetric inequality. J. London Math. Soc. 44(2), 351\u2013359 (1991). https:\/\/doi.org\/10.1112\/jlms\/s2-44.2.351","journal-title":"J. London Math. Soc."},{"key":"815_CR14","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/BF01452053","volume":"285","author":"I B\u00e1r\u00e1ny","year":"1989","unstructured":"B\u00e1r\u00e1ny, I.: Intrinsic volumes and $$f$$-vectors of random polytopes. Math. Ann. 285, 671\u2013699 (1989)","journal-title":"Math. Ann."},{"key":"815_CR15","unstructured":"B\u00e1r\u00e1ny, I.: The technique of M-regions and cap-coverings: A survey. Rend. Circ. Mat. Palermo, 65:21\u201338, (2000). https:\/\/users.renyi.hu\/~barany\/"},{"key":"815_CR16","doi-asserted-by":"publisher","unstructured":"B\u00e1r\u00e1ny, I.: Random polytopes, convex bodies, and approximation. In W.\u00a0Weil, editor, Stochastic Geometry, volume 1892 of Lecture Notes in Mathematics, pp. 77\u2013118. Springer, (2007). https:\/\/doi.org\/10.1007\/978-3-540-38175-4_2","DOI":"10.1007\/978-3-540-38175-4_2"},{"key":"815_CR17","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1112\/S0025579300015266","volume":"35","author":"I B\u00e1r\u00e1ny","year":"1988","unstructured":"B\u00e1r\u00e1ny, I., Larman, D.G.: Convex bodies, economic cap coverings, random polytopes. Mathematika 35, 274\u2013291 (1988). https:\/\/doi.org\/10.1112\/S0025579300015266","journal-title":"Mathematika"},{"issue":"2","key":"815_CR18","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1112\/S0025579300014984","volume":"39","author":"U Betke","year":"1992","unstructured":"Betke, U., Henk, M.: Estimating sizes of a convex body by successive diameters and widths. Mathematika 39(2), 247\u2013257 (1992). https:\/\/doi.org\/10.1112\/S0025579300014984","journal-title":"Mathematika"},{"key":"815_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1515\/advgeom-2017-0038","volume":"18","author":"G Bonnet","year":"2018","unstructured":"Bonnet, G.: Polytopal approximation of elongated convex bodies. Adv. Geom. 18, 105\u2013114 (2018). https:\/\/doi.org\/10.1515\/advgeom-2017-0038","journal-title":"Adv. Geom."},{"key":"815_CR20","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF01388911","volume":"88","author":"J Bourgain","year":"1987","unstructured":"Bourgain, J., Milman, V.D.: New volume ratio properties for convex symmetric bodies. Invent. Math. 88, 319\u2013340 (1987). https:\/\/doi.org\/10.1007\/BF01388911","journal-title":"Invent. Math."},{"key":"815_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02573971","volume":"10","author":"H Br\u00f6nnimann","year":"1993","unstructured":"Br\u00f6nnimann, H., Chazelle, B., Pach, J.: How hard is halfspace range searching? Discrete Comput. Geom. 10, 143\u2013155 (1993). https:\/\/doi.org\/10.1007\/BF02573971","journal-title":"Discrete Comput. Geom."},{"key":"815_CR22","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14, 463\u2013479 (1995). https:\/\/doi.org\/10.1007\/BF02570718","journal-title":"Discrete Comput. Geom."},{"key":"815_CR23","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/BF00967115","volume":"16","author":"EM Bronshteyn","year":"1976","unstructured":"Bronshteyn, E.M., Ivanov, L.D.: The approximation of convex sets by polyhedra. Siberian Math. J. 16, 852\u2013853 (1976). https:\/\/doi.org\/10.1007\/BF00967115","journal-title":"Siberian Math. J."},{"issue":"6","key":"815_CR24","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10958-008-9144-x","volume":"153","author":"EM Bronstein","year":"2008","unstructured":"Bronstein, E.M.: Approximation of convex sets by polytopes. J. Math. Sci. 153(6), 727\u2013762 (2008). https:\/\/doi.org\/10.1007\/s10958-008-9144-x","journal-title":"J. Math. Sci."},{"key":"815_CR25","doi-asserted-by":"crossref","unstructured":"Clarkson, K.\u00a0L.: Algorithms for polytope covering and approximation. In: Proc. Third Internat. Workshop Algorithms Data Struct., pp. 246\u2013252, (1993)","DOI":"10.1007\/3-540-57155-8_252"},{"key":"815_CR26","doi-asserted-by":"publisher","unstructured":"Clarkson, K.\u00a0L.: Building triangulations using $$\\varepsilon $$-nets. In: Proc. 38th Annual. ACM Sympos. Theory Comput., pp. 326\u2013335, (2006). https:\/\/doi.org\/10.1145\/1132516.1132564","DOI":"10.1145\/1132516.1132564"},{"key":"815_CR27","unstructured":"Das, G., Joseph, D.: The complexity of minimum convex nested polyhedra. In Proc. Second Canad. Conf. Comput. Geom., pp. 296\u2013301, (1990)"},{"key":"815_CR28","unstructured":"do\u00a0Carmo, M.\u00a0P.: Differential Geometry of Curves and Surfaces. Prentice Hall (1976)"},{"issue":"3","key":"815_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0021-9045(74)90120-8","volume":"10","author":"RM Dudley","year":"1974","unstructured":"Dudley, R.M.: Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory 10(3), 227\u2013236 (1974). https:\/\/doi.org\/10.1016\/0021-9045(74)90120-8","journal-title":"J. Approx. Theory"},{"key":"815_CR30","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1007\/s00454-019-00075-0","volume":"61","author":"K Dutta","year":"2019","unstructured":"Dutta, K., Ghosh, A., Jartoux, B., Mustafa, N.H.: Shallow packings, semialgebraic set systems, Macbeath regions and polynomial partitioning. Discrete Comput. Geom. 61, 756\u2013777 (2019). https:\/\/doi.org\/10.1007\/s00454-019-00075-0","journal-title":"Discrete Comput. Geom."},{"key":"815_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/S0025579300002655","volume":"17","author":"G Ewald","year":"1970","unstructured":"Ewald, G., Larman, D.G., Rogers, C.A.: The directions of the line segments and of the $$r$$-dimensional balls on the boundary of a convex body in Euclidean space. Mathematika 17, 1\u201320 (1970). https:\/\/doi.org\/10.1112\/S0025579300002655","journal-title":"Mathematika"},{"key":"815_CR32","doi-asserted-by":"publisher","unstructured":"Federer, H.: Geometric Measure Theory. Springer Berlin, Heidelberg, (1996). https:\/\/doi.org\/10.1007\/978-3-642-62010-2","DOI":"10.1007\/978-3-642-62010-2"},{"key":"815_CR33","doi-asserted-by":"publisher","unstructured":"Gruber, P.\u00a0M.: Aspects of approximation of convex bodies. In: P.\u00a0M. Gruber and J.\u00a0M. Wills, editors, Handbook of Convex Geometry, chapter 1.10, pp. 319\u2013345. North-Holland, (1993). https:\/\/doi.org\/10.1016\/B978-0-444-89596-7.50015-8","DOI":"10.1016\/B978-0-444-89596-7.50015-8"},{"key":"815_CR34","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1137\/140959067","volume":"44","author":"S Har-Peled","year":"2015","unstructured":"Har-Peled, S., Kumar, N.: Approximating minimization diagrams and generalized proximity search. SIAM J. Comput. 44, 944\u2013974 (2015). https:\/\/doi.org\/10.1137\/140959067","journal-title":"SIAM J. Comput."},{"key":"815_CR35","unstructured":"John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays Presented to R. Courant on his 60th Birthday, pp. 187\u2013204. Interscience Publishers Inc, New York (1948)"},{"key":"815_CR36","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1007\/s00039-008-0669-4","volume":"18","author":"G Kuperberg","year":"2008","unstructured":"Kuperberg, G.: From the Mahler conjecture to Gauss linking integrals. Geom. Funct. Anal. 18, 870\u2013892 (2008). https:\/\/doi.org\/10.1007\/s00039-008-0669-4","journal-title":"Geom. Funct. Anal."},{"key":"815_CR37","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/1969800","volume":"56","author":"AM Macbeath","year":"1952","unstructured":"Macbeath, A.M.: A theorem on non-homogeneous lattices. Ann. of Math. 56, 269\u2013293 (1952). https:\/\/doi.org\/10.2307\/1969800","journal-title":"Ann. of Math."},{"key":"815_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0039-7","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry. Springer-Verlag (2002). https:\/\/doi.org\/10.1007\/978-1-4613-0039-7","journal-title":"Lectures on Discrete Geometry. Springer-Verlag"},{"key":"815_CR39","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/0022-247X(75)90125-0","volume":"51","author":"DE McClure","year":"1975","unstructured":"McClure, D.E., Vitalie, R.A.: Polygonal approximation of plane convex bodies. J. Math. Anal. Appl. 51, 326\u2013358 (1975). https:\/\/doi.org\/10.1016\/0022-247X(75)90125-0","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"815_CR40","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1017\/S0305004100051665","volume":"78","author":"P McMullen","year":"1975","unstructured":"McMullen, P.: Non-linear angle-sum relations for polyhedral cones and polytopes. Math. Proc. Cambridge Philos. Soc. 78(2), 247\u2013261 (1975). https:\/\/doi.org\/10.1017\/S0305004100051665","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"815_CR41","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01299276","volume":"111","author":"P McMullen","year":"1991","unstructured":"McMullen, P.: Inequalities between intrinsic volumes. Monatshefte f\u00fcr Mathematik 111, 47\u201353 (1991). https:\/\/doi.org\/10.1007\/BF01299276","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"815_CR42","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/265","author":"NH Mustafa","year":"2022","unstructured":"Mustafa, N.H.: Sampling in Combinatorial and Geometric Set Systems, volume 265 of Mathematical Surveys and Monographs. AMS (2022). https:\/\/doi.org\/10.1090\/surv\/265","journal-title":"AMS"},{"key":"815_CR43","doi-asserted-by":"publisher","unstructured":"Mustafa, N.\u00a0H., Ray, S.: Near-optimal generalisations of a theorem of Macbeath. In Proc. 31st Internat. Sympos. on Theoret. Aspects of Comp. Sci., pp. 578\u2013589, (2014). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2014.578","DOI":"10.4230\/LIPIcs.STACS.2014.578"},{"key":"815_CR44","doi-asserted-by":"publisher","unstructured":"Nazarov, F.: The H\u00f6rmander proof of the Bourgain-Milman theorem. In: Geometric Aspects of Functional Analysis, pp. 335\u2013343. Springer, (2012). https:\/\/doi.org\/10.1007\/978-3-642-29849-3_20","DOI":"10.1007\/978-3-642-29849-3_20"},{"key":"815_CR45","doi-asserted-by":"publisher","unstructured":"Rockafellar, R.\u00a0T.: Conjugates and Legendre transforms of convex functions. Canad. J. Math., pp. 200\u2013205 (1967). https:\/\/doi.org\/10.4153\/CJM-1967-012-4","DOI":"10.4153\/CJM-1967-012-4"},{"key":"815_CR46","doi-asserted-by":"publisher","unstructured":"Rockafellar, R.\u00a0T.: Convex Analysis. Princeton University Press, Princeton, NJ, (1997). https:\/\/doi.org\/10.1515\/9781400873173","DOI":"10.1515\/9781400873173"},{"key":"815_CR47","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02238642","volume":"48","author":"G Rote","year":"1992","unstructured":"Rote, G.: The convergence rate of the sandwich algorithm for approximating convex functions. Computing 48, 337\u2013361 (1992). https:\/\/doi.org\/10.1007\/BF02238642","journal-title":"Computing"},{"key":"815_CR48","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/0022-247X(87)90197-1","volume":"128","author":"R Schneider","year":"1987","unstructured":"Schneider, R.: Polyhedral approximation of smooth convex bodies. J. Math. Anal. Appl. 128, 470\u2013474 (1987). https:\/\/doi.org\/10.1016\/0022-247X(87)90197-1","journal-title":"J. Math. Anal. Appl."},{"key":"815_CR49","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1090\/S0002-9904-1948-09022-X","volume":"54","author":"LF Toth","year":"1948","unstructured":"Toth, L.F.: Approximation by polygons and polyhedra. Bull. Amer. Math. Soc. 54, 431\u2013438 (1948). https:\/\/doi.org\/10.1090\/S0002-9904-1948-09022-X","journal-title":"Bull. Amer. Math. Soc."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00815-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-025-00815-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-025-00815-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T17:01:12Z","timestamp":1775322072000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-025-00815-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,17]]},"references-count":49,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["815"],"URL":"https:\/\/doi.org\/10.1007\/s00454-025-00815-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,17]]},"assertion":[{"value":"2 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}