{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:06:31Z","timestamp":1760439991113},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6956,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0925-7721(94)90005-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"157-176","source":"Crossref","is-referenced-by-count":6,"title":["Testing geometric objects"],"prefix":"10.1016","volume":"4","author":[{"given":"Kathleen","family":"Romantik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carl","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(94)90005-1_BIB1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/12130.12158","article-title":"Classifying learnable geometric concepts with the Vapnik\u2014Chervonenkis dimension","author":"Blumer","year":"1986","journal-title":"Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0925-7721(94)90005-1_BIB2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(86)90103-1","article-title":"Determining the shape of a convex n-sided polygon by using 2n + k tactile probes","volume":"22","author":"Bernstein","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(94)90005-1_BIB3","series-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","first-page":"80","article-title":"Learnability by fixed distributions","author":"Benedek","year":"1988"},{"key":"10.1016\/0925-7721(94)90005-1_BIB4","series-title":"Technical Report CMPT TR 91-12","article-title":"Probing polygons minimally is hard","author":"Belleville","year":"1991"},{"key":"10.1016\/0925-7721(94)90005-1_BIB5","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0196-6774(87)90025-3","article-title":"Shape from probing","volume":"8","author":"Cole","year":"1987","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(94)90005-1_BIB6","first-page":"303","article-title":"On the complexity of teaching","author":"Goldman","year":"1991"},{"key":"10.1016\/0925-7721(94)90005-1_BIB7","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"\u03f5-Nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(94)90005-1_BIB8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0925-7721(92)90023-L","article-title":"Model-based probing strategies for convex polygons","volume":"2","author":"Joseph","year":"1992","journal-title":"Comput. Geom."},{"key":"10.1016\/0925-7721(94)90005-1_BIB9","series-title":"Ph.D. Thesis","article-title":"Reconstructing objects from projections","author":"Karl","year":"1991"},{"key":"10.1016\/0925-7721(94)90005-1_BIB10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(88)90196-2","article-title":"Reconstruction of polygons from projections","volume":"28","author":"Li","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0925-7721(94)90005-1_BIB11","doi-asserted-by":"crossref","DOI":"10.1145\/130385.130422","article-title":"Approximate testing and learnability","author":"Romanik","year":"1992"},{"key":"10.1016\/0925-7721(94)90005-1_BIB12","series-title":"Ph.D. Thesis","article-title":"Approximate testing theory","author":"Romanik","year":"1992"},{"key":"10.1016\/0925-7721(94)90005-1_BIB13","series-title":"Proceedings of the Fourth Canadian Conference on Computational Geometry","first-page":"216","article-title":"Testing orthogonal shapes","author":"Romanik","year":"1992"},{"key":"10.1016\/0925-7721(94)90005-1_BIB14","series-title":"Ph.D. Thesis","article-title":"Geometric probing","author":"Skiena","year":"1988"},{"key":"10.1016\/0925-7721(94)90005-1_BIB15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/1116025","article-title":"Chervonenkis, On the uniform convergence of relative frequencies of events to their probabilities","volume":"16","author":"Vapnik","year":"1971","journal-title":"Theory Probab. Appl."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194900051?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772194900051?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:51:30Z","timestamp":1555116690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772194900051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0925772194900051"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(94)90005-1","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}