{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:10:14Z","timestamp":1760044214301},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602200"},{"type":"electronic","value":"9783540447474"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60220-8_52","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:53:45Z","timestamp":1330278825000},"page":"74-85","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the complexity of approximating and illuminating three-dimensional convex polyhedra"],"prefix":"10.1007","author":[{"given":"Gautam","family":"Das","sequence":"first","affiliation":[]},{"given":"Michael T.","family":"Goodrich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","unstructured":"P. K. Agarwal and S. Suri. Surface approximation and geometric partitions. In Proc. Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1994."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0890-5401(89)90049-7","volume":"83","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, and C. K. Yap. Finding minimal convex nested polygons. Inform. Comput., 83(1):98\u2013110, October 1989.","journal-title":"Inform. Comput."},{"key":"7_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0893-6080(05)80010-3","volume":"5","author":"A. Blum","year":"1992","unstructured":"A. Blum and R. L. Rivest. Training a 3-node neural net is NP-Complete. Neural Networks, 5:117\u2013127, 1992.","journal-title":"Neural Networks"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"H. Br\u00f6nnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 293\u2013302, 1994.","DOI":"10.1145\/177424.178029"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/3-540-57155-8_252","volume":"709","author":"K. L. Clarkson","year":"1993","unstructured":"K. L. Clarkson. Algorithms for polytope covering and approximation. In Proc. 3rd Workshop Algorithms Data Struct., volume 709 of Lecture Notes in Computer Science, pages 246\u2013252, 1993.","journal-title":"Proc. 3rd Workshop Algorithms Data Struct"},{"key":"7_CR6","unstructured":"G. Das. Approximation schemes in computational geometry. Ph.D. thesis, University of Wisconsin, 1990."},{"key":"7_CR7","unstructured":"G. Das and D. Joseph. The complexity of minimum convex nested polyhedra. In Proc. 2nd Canad. Conf. Comput. Geom., pages 296\u2013301, 1990."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0304-3975(92)90088-W","volume":"103","author":"G. Das","year":"1992","unstructured":"G. Das and D. Joseph. Minimum vertex hulls for polyhedral domains. Theoret. Comput. Sci., 103:107\u2013135, 1992.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","volume":"27","author":"D. P. Dobkin","year":"1983","unstructured":"D. P. Dobkin and D. G. Kirkpatrick. Fast detection of polyhedral intersection. Theoret. Comput. Sci., 27:241\u2013253, 1983.","journal-title":"Theoret. Comput. Sci."},{"key":"7_CR10","volume-title":"volume 10 of EATCS Monographs on Theoretical Computer Science","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"M. R. Garey","year":"1977","unstructured":"M. R. Garey and D. S. Johnson. The rectilinear Steiner tree problem is NP-complete. SIAM J. Appl. Math., 32:826\u2013834, 1977.","journal-title":"SIAM J. Appl. Math."},{"key":"7_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M. R. Garey","year":"1976","unstructured":"M. R. Garey, D. S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237\u2013267, 1976.","journal-title":"Theoretical Computer Science"},{"key":"7_CR14","volume-title":"Convex Polytopes","author":"B. Gr\u00fcnbaum","year":"1967","unstructured":"B. Gr\u00fcnbaum. Convex Polytopes. Wiley, New York, NY, 1967."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L. Hyafil","year":"1976","unstructured":"L. Hyafil and R. L. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5:15\u201317, 1976.","journal-title":"Information Processing Letters"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0885-064X(88)90019-2","volume":"4","author":"S. Judd","year":"1988","unstructured":"S. Judd. On the complexity of loading shallow neural networks. J. of Complexity, 4:177\u2013192, 1988.","journal-title":"J. of Complexity"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick. Optimal search in planar subdivisions. SIAM J. Comput., 12:28\u201335, 1983.","journal-title":"SIAM J. Comput."},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02187916","volume":"3","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo. On the complexity of polyhedral separability. Discrete Comput. Geom., 3:325\u2013337, 1988.","journal-title":"Discrete Comput. Geom."},{"key":"7_CR19","unstructured":"J. S. B. Mitchell and S. Suri. Separation and approximation of polyhedral surfaces. In Proc. 3rd ACM-SIAM Sympos. Discrete Algorithms, pages 296\u2013306, 1992."},{"key":"7_CR20","volume-title":"Art Gallery Theorems and Algorithms","author":"J. O'Rourke","year":"1987","unstructured":"J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, New York, NY, 1987."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/58395.58397","volume":"19","author":"J. O'Rourke","year":"1988","unstructured":"J. O'Rourke. Computational geometry column 4. SIGACT News, 19(2):22\u201324, 1988. Also in Computer Graphics 22(1988), 111\u2013112.","journal-title":"SIGACT News"},{"key":"7_CR22","first-page":"109","volume":"28","author":"C. B. Silio Jr.","year":"1979","unstructured":"C. B. Silio, Jr.. An efficient simplex coverability algorithm in E\n2 with applications to stochastic sequential machines. IEEE Trans. Comput., C-28:109\u2013120, 1979.","journal-title":"IEEE Trans. Comput."},{"key":"7_CR23","volume-title":"Vorlesungen \u00fcber die Theorie der Polyeder","author":"E. Steinitz","year":"1934","unstructured":"E. Steinitz and H. Rademacher. Vorlesungen \u00fcber die Theorie der Polyeder. Julius Springer, Berlin, Germany, 1934."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60220-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:19:55Z","timestamp":1578536395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60220-8_52"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602200","9783540447474"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-60220-8_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}