{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:36:37Z","timestamp":1725543397597},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540351573"},{"type":"electronic","value":"9783540351580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11775096_17","type":"book-chapter","created":{"date-parts":[[2006,6,22]],"date-time":"2006-06-22T08:40:18Z","timestamp":1150965618000},"page":"173-184","source":"Crossref","is-referenced-by-count":2,"title":["Distributions of Points and Large Convex Hulls of k Points"],"prefix":"10.1007","author":[{"given":"Hanno","family":"Lefmann","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0097-3165(82)90049-8","volume":"32","author":"M. Ajtai","year":"1982","unstructured":"Ajtai, M., Koml\u00f3s, J., Pintz, J., Spencer, J., Szemer\u00e9di, E.: Extremal Uncrowded Hypergraphs. Journal of Combinatorial Theory Ser. A\u00a032, 321\u2013335 (1982)","journal-title":"Journal of Combinatorial Theory Ser. A"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/S0895480100365859","volume":"14","author":"G. Barequet","year":"2001","unstructured":"Barequet, G.: A Lower Bound for Heilbronn\u2019s Triangle Problem in d Dimensions. SIAM Journal on Discrete Mathematics\u00a014, 230\u2013236 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45655-4_39","volume-title":"Computing and Combinatorics","author":"G. Barequet","year":"2002","unstructured":"Barequet, G.: The On-Line Heilbronn\u2019s Triangle Problem in Three and Four Dimensions. In: H. Ibarra, O., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 360\u2013369. Springer, Heidelberg (2002)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1137\/S0097539798348870","volume":"30","author":"C. Bertram-Kretzberg","year":"2000","unstructured":"Bertram-Kretzberg, C., Hofmeister, T., Lefmann, H.: An Algorithm for Heilbronn\u2019s Problem. SIAM Journal on Computing\u00a030, 383\u2013390 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/S0895480103435810","volume":"19","author":"P. Brass","year":"2005","unstructured":"Brass, P.: An Upper Bound for the d-Dimensional Heilbronn Triangle Problem. SIAM Journal on Discrete Mathematics\u00a019, 192\u2013195 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"17_CR6","volume-title":"An Introduction to the Geometry of Numbers","author":"J.W.S. Cassels","year":"1971","unstructured":"Cassels, J.W.S.: An Introduction to the Geometry of Numbers, vol.\u00a099. Springer, New York (1971)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1090\/S0894-0347-1989-1001852-0","volume":"2","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B.: Lower Bounds on the Complexity of Polytope Range Searching. Journal of the American Mathematical Society\u00a02, 637\u2013666 (1989)","journal-title":"Journal of the American Mathematical Society"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/rsa.10024","volume":"20","author":"T. Jiang","year":"2002","unstructured":"Jiang, T., Li, M., Vitany, P.: The Average Case Area of Heilbronn-type Triangles. Random Structures & Algorithms\u00a020, 206\u2013219 (2002)","journal-title":"Random Structures & Algorithms"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/jlms\/s2-24.3.385","volume":"24","author":"J. Koml\u00f3s","year":"1981","unstructured":"Koml\u00f3s, J., Pintz, J., Szemer\u00e9di, E.: On Heilbronn\u2019s Triangle Problem. Journal of the London Mathematical Society\u00a024, 385\u2013396 (1981)","journal-title":"Journal of the London Mathematical Society"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1112\/jlms\/s2-25.1.13","volume":"25","author":"J. Koml\u00f3s","year":"1982","unstructured":"Koml\u00f3s, J., Pintz, J., Szemer\u00e9di, E.: A Lower Bound for Heilbronn\u2019s Problem. Journal of the London Mathematical Society\u00a025, 13\u201324 (1982)","journal-title":"Journal of the London Mathematical Society"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s00493-003-0040-1","volume":"23","author":"H. Lefmann","year":"2003","unstructured":"Lefmann, H.: On Heilbronn\u2019s Problem in Higher Dimension. Combinatorica\u00a023, 669\u2013680 (2003)","journal-title":"Combinatorica"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-27798-9_7","volume-title":"Computing and Combinatorics","author":"H. Lefmann","year":"2004","unstructured":"Lefmann, H.: Large Triangles in the d-Dimensional Unit-Cube. In: Chwa, K.-Y., Munro, J.I.J. (eds.) COCOON 2004. LNCS, vol.\u00a03106, pp. 43\u201352. Springer, Heidelberg (2004)"},{"key":"17_CR13","unstructured":"Lefmann, H.: Distributions of Points in the Unit-Square and Large k-Gons. In: Proceedings ACM-SIAM Syposium on Discrete Algorithms, SODA 2005, pp. 241\u2013250. ACM\/SIAM (2005)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/11533719_52","volume-title":"Computing and Combinatorics","author":"H. Lefmann","year":"2005","unstructured":"Lefmann, H.: Large Simplices in the d-Dimensional Unit-Cube (Extended Abstract). In: Wang, L. (ed.) COCOON 2005. LNCS, vol.\u00a03595, pp. 514\u2013523. Springer, Heidelberg (2005)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1137\/S0097539701395115","volume":"31","author":"H. Lefmann","year":"2002","unstructured":"Lefmann, H., Schmitt, N.: A Deterministic Polynomial Time Algorithm for Heilbronn\u2019s Problem in Three Dimensions. SIAM Journal on Computing\u00a031, 1926\u20131947 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1112\/jlms\/s1-26.3.198","volume":"26","author":"K.F. Roth","year":"1951","unstructured":"Roth, K.F.: On a Problem of Heilbronn. Journal of the London Mathematical Society\u00a026, 198\u2013204 (1951)","journal-title":"Journal of the London Mathematical Society"},{"issue":"3","key":"17_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1112\/plms\/s3-25.2.193","volume":"25","author":"K.F. Roth","year":"1972","unstructured":"Roth, K.F.: On a Problem of Heilbronn, II, and III. Proc. of the London Mathematical Society\u00a025(3), 193\u2013212, 543\u2013549 (1972)","journal-title":"Proc. of the London Mathematical Society"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Roth, K.F.: Estimation of the Area of the Smallest Triangle Obtained by Selecting Three out of n Points in a Disc of Unit Area. In: Proc. of Symposia in Pure Mathematics, AMS, Providence, vol.\u00a024, pp. 251\u2013262 (1973)","DOI":"10.1090\/pspum\/024\/0335445"},{"key":"17_CR19","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0001-8708(76)90100-6","volume":"22","author":"K.F. Roth","year":"1976","unstructured":"Roth, K.F.: Developments in Heilbronn\u2019s Triangle Problem. Advances in Mathematics\u00a022, 364\u2013385 (1976)","journal-title":"Advances in Mathematics"},{"issue":"2","key":"17_CR20","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1112\/jlms\/s2-4.3.545","volume":"4","author":"W.M. Schmidt","year":"1972","unstructured":"Schmidt, W.M.: On a Problem of Heilbronn. Journal of the London Mathematical Society\u00a04(2), 545\u2013550 (1972)","journal-title":"Journal of the London Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11775096_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:14:35Z","timestamp":1619507675000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11775096_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540351573","9783540351580"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11775096_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}