{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:30Z","timestamp":1750308630122,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":4,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T00:00:00Z","timestamp":1332720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,3,26]]},"DOI":"10.1145\/2245276.2245447","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T13:03:31Z","timestamp":1339419811000},"page":"879-884","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Minimum bounding boxes for regular cross-polytopes"],"prefix":"10.1145","author":[{"given":"Salman","family":"Shahid","sequence":"first","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sakti","family":"Pramanik","sequence":"additional","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles B.","family":"Owen","sequence":"additional","affiliation":[{"name":"Michigan State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,3,26]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"183","article-title":"Finding minimal enclosing boxes","volume":"14","author":"O'Rourke J.","year":"1985","unstructured":"J. O'Rourke , \" Finding minimal enclosing boxes ,\" International Journal of Parallel Programming , vol. 14 , pp. 183 -- 199 , 1985 . 10.1007\/BF00991005. J. O'Rourke, \"Finding minimal enclosing boxes,\" International Journal of Parallel Programming, vol. 14, pp. 183--199, 1985. 10.1007\/BF00991005.","journal-title":"International Journal of Parallel Programming"},{"issue":"1","key":"e_1_3_2_1_2_1","first-page":"409","article-title":"Transforming range queries to equivalent box queries to optimize page access","volume":"3","author":"Pramanik S.","year":"2010","unstructured":"S. Pramanik , A. Watve , C. R. Meiners , and A. X. Liu , \" Transforming range queries to equivalent box queries to optimize page access ,\" PVLDB , vol. 3 , no. 1 , pp. 409 -- 416 , 2010 . S. Pramanik, A. Watve, C. R. Meiners, and A. X. Liu, \"Transforming range queries to equivalent box queries to optimize page access,\" PVLDB, vol. 3, no. 1, pp. 409--416, 2010.","journal-title":"PVLDB"},{"key":"e_1_3_2_1_3_1","volume-title":"SODA '99","author":"Barequet G.","year":"1999","unstructured":"G. Barequet and S. Har-Peled , \" Efficiently approximating the minimum-volume bounding box of a point set in three dimensions,\" in Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms , SODA '99 , 1999 . G. Barequet and S. Har-Peled, \"Efficiently approximating the minimum-volume bounding box of a point set in three dimensions,\" in Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, SODA '99, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/2945.675649"}],"event":{"name":"SAC 2012: ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Trento Italy","acronym":"SAC 2012"},"container-title":["Proceedings of the 27th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2245276.2245447","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2245276.2245447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:07:55Z","timestamp":1750273675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2245276.2245447"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,26]]},"references-count":4,"alternative-id":["10.1145\/2245276.2245447","10.1145\/2245276"],"URL":"https:\/\/doi.org\/10.1145\/2245276.2245447","relation":{},"subject":[],"published":{"date-parts":[[2012,3,26]]},"assertion":[{"value":"2012-03-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}