{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T11:51:45Z","timestamp":1753357905540},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1007\/pl00009296","type":"journal-article","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T17:37:41Z","timestamp":1140197861000},"page":"307-318","source":"Crossref","is-referenced-by-count":13,"title":["A combinatorial property of convex sets"],"prefix":"10.1007","volume":"17","author":[{"given":"M.","family":"Abellanas","sequence":"first","affiliation":[]},{"given":"G.","family":"Hernandez","sequence":"additional","affiliation":[]},{"given":"R.","family":"Klein","sequence":"additional","affiliation":[]},{"given":"V.","family":"Neumann-Lara","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"170300307_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02187798","volume":"5","author":"I. B\u00e1r\u00e1ny","year":"1990","unstructured":"I. B\u00e1r\u00e1ny and D. G. Larman, A combinatorial property of points and ellipsoids, Discrete Comput. Geom. 5 (1990), 375\u2013382.","journal-title":"Discrete Comput. Geom."},{"key":"170300307_CR2","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02187727","volume":"4","author":"I. B\u00e1r\u00e1ny","year":"1989","unstructured":"I. B\u00e1r\u00e1ny, J. H. Schmerl, S. J. Sidney, and J. Urrutia, A combinatorial result about points and balls in Euclidean space, Discrete Comput. Geom. 4 (1989), 259\u2013262.","journal-title":"Discrete Comput. Geom."},{"key":"170300307_CR3","doi-asserted-by":"crossref","unstructured":"P. Chew and S. Drysdale, Voronoi diagrams based on convex distance functions, Proc. 1st ACM Symposium on Computational Geometry, Baltimore, MD, 1985, pp. 235\u2013244.","DOI":"10.1145\/323233.323264"},{"key":"170300307_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00181432","volume":"32","author":"H. Edelsbrunner","year":"1989","unstructured":"H. Edelsbrunner, N. Hasan, R. Seidel, and X. J. Shen, Circles through two points that always enclose many points, Geom. Dedicata 32 (1989), 1\u201312.","journal-title":"Geom. Dedicata"},{"key":"170300307_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00354889","volume":"5","author":"P. C. Fishburn","year":"1988","unstructured":"P. C. Fishburn, Interval orders and circle orders, Order 5 (1988), 225\u2013234.","journal-title":"Order"},{"key":"170300307_CR6","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02187728","volume":"4","author":"R. Hyward","year":"1989","unstructured":"R. Hyward, A note on the circle containment problem, Discrete Comput. Geom. 4 (1989), 263\u2013264.","journal-title":"Discrete Comput. Geom."},{"key":"170300307_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF02187726","volume":"4","author":"R. Hyward","year":"1989","unstructured":"R. Hyward, D. Rappaport, and R. Wenger, Some extremal results on circles containing points, Discrete Comput. Geom. 4 (1989), 253\u2013258.","journal-title":"Discrete Comput. Geom."},{"key":"170300307_CR8","doi-asserted-by":"crossref","unstructured":"Ch. Ickling, R. Klein, M. Le, and L. Ma, Convex distance functions in 3-space are different, Proc. 9th ACM Symposium on Computational Geometry, 1993, pp. 116\u2013123.","DOI":"10.1145\/160985.161007"},{"key":"170300307_CR9","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0925-7721(93)90033-3","volume":"3","author":"R. Klein","year":"1993","unstructured":"R. Klein, K. Melhorn, and S. Meiser, Randomized incremental construction of abstract Voronoi diagrams, Comput. Geom. Theory Appl. 3 (1993), 157\u2013184.","journal-title":"Comput. Geom. Theory Appl."},{"key":"170300307_CR10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(88)90015-5","volume":"69","author":"V. Neumann-Lara","year":"1988","unstructured":"V. Neumann-Lara and J. Urrutia, A combinatorial result on points and circles in the plane, Discrete Math. 69(1988), 173\u2013178.","journal-title":"Discrete Math."},{"key":"170300307_CR11","doi-asserted-by":"crossref","unstructured":"J. Urrutia, Partial orders and Euclidean geometry, in Algorithms and Order, ed. I. Rival, Kluwer, Boston, MA, 1989, pp. 387\u2013434.","DOI":"10.1007\/978-94-009-2639-4_11"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/PL00009296.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/PL00009296\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/PL00009296","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T13:20:47Z","timestamp":1558531247000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/PL00009296"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["170300307"],"URL":"https:\/\/doi.org\/10.1007\/pl00009296","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}