{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T10:08:55Z","timestamp":1787738935144,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319165943","type":"print"},{"value":"9783319165950","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16595-0_7","type":"book-chapter","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T13:42:10Z","timestamp":1430314930000},"page":"109-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":193,"title":["Computing Large Convex Regions of Obstacle-Free Space Through Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Robin","family":"Deits","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Russ","family":"Tedrake","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: More examples of CQ-representable functions\/sets. Lectures on Modern Convex Optimization: Analysis. Algorithms and Engineering Applications, pp. 105\u2013110. MPS-SIAM Series on Optimization, SIAM, Philadelphia, PA (2001)","DOI":"10.1137\/1.9780898718829"},{"key":"7_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"key":"7_CR3","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. AAAI 6, 942\u2013947 (2006). http:\/\/www.aaai.org\/Papers\/AAAI\/2006\/AAAI06-148.pdf"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Eidenbenz, S.J., Widmayer, P.: An approximation algorithm for minimum convex cover with logarithmic performance guarantee. SIAM J. Comput. 32(3), 654\u2013670 (2003). http:\/\/epubs.siam.org\/doi\/abs\/10.1137\/S0097539702405139","DOI":"10.1137\/S0097539702405139"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Fallon, M., Kuindersma, S., Karumanchi, S., Antone, M., Schneider, T., Dai, H., Perez D\u2019Arpino, C., Deits, R., DiCicco, M., Fourie, D., Koolen, T., Marion, P., Posa, M., Valenzuela, A., Yu, K.T., Shah, J., Iagnemma, K., Tedrake, R., Teller, S.: An architecture for online affordance-based perception and whole-body planning. J. Field Robot. (2014). http:\/\/dspace.mit.edu\/handle\/1721.1\/85690","DOI":"10.1002\/rob.21546"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Feng, H.Y.F., Pavlidis, T.: Decomposition of polygons into simpler components: feature generation for syntactic pattern recognition. IEEE Trans. Comput. 100(6), 636\u2013650 (1975). http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=1672869","DOI":"10.1109\/T-C.1975.224276"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Fischer, P.: Finding maximum convex polygons. In: sik, Z. (ed.) Fundamentals of Computation Theory. Lecture Notes in Computer Science, vol. 710, pp. 234\u2013243. Springer, Berlin (1993). http:\/\/link.springer.com\/chapter\/10.1007\/3-540-57163-9_19","DOI":"10.1007\/3-540-57163-9_19"},{"key":"7_CR8","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1 (2014). http:\/\/cvxr.com\/cvx"},{"key":"7_CR9","unstructured":"Gurobi Optimization Inc: Gurobi optimizer reference manual (2014). http:\/\/www.gurobi.com\/"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Khachiyan, L.G., Todd, M.J.: On the complexity of approximating the maximal inscribed ellipsoid for a polytope. Math. Program. 61(1\u20133), 137\u2013159 (1993). http:\/\/link.springer.com\/article\/10.1007\/BF01582144","DOI":"10.1007\/BF01582144"},{"key":"7_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971217","volume-title":"Solving Least Squares Problems","author":"CL Lawson","year":"1995","unstructured":"Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. SIAM, Philadelphia (1995)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Lien, J.M., Amato, N.M.: Approximate convex decomposition of polygons. In: Proceedings of the Twentieth annual symposium on Computational Geometry, pp. 17\u201326 (2004). http:\/\/dl.acm.org\/citation.cfm?id=997823","DOI":"10.1145\/997817.997823"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Lingas, A.: The power of non-rectilinear holes. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 140, pp. 369\u2013383. Springer, Berlin (1982). http:\/\/link.springer.com\/chapter\/10.1007\/BFb0012784","DOI":"10.1007\/BFb0012784"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Liu, H., Liu, W., Latecki, L.: Convex shape decomposition. In: 2010 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 97\u2013104 (2010)","DOI":"10.1109\/CVPR.2010.5540225"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Lozano-Perez, T.: Spatial planning: a configuration space approach. IEEE Trans. Comput (2), 108\u2013120 (1983). http:\/\/ieeexplore.ieee.org\/xpl\/articleDetails.jsp?arnumber=1676196","DOI":"10.1109\/TC.1983.1676196"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Luchnikov, V.A., Medvedev, N.N., Oger, L., Troadec, J.P.: Voronoi-delaunay analysis of voids in systems of nonspherical particles. Phys. Rev. E 59(6), 7205 (1999). http:\/\/pre.aps.org\/abstract\/PRE\/v59\/i6\/p7205_1","DOI":"10.1103\/PhysRevE.59.7205"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Mamou, K., Ghorbel, F.: A simple and efficient approach for 3d mesh approximate convex decomposition. In: 2009 16th IEEE International Conference on Image Processing (ICIP), pp. 3501\u20133504 (2009)","DOI":"10.1109\/ICIP.2009.5414068"},{"key":"7_CR18","unstructured":"MATLAB: version 8.2.0.701 (R2013b). The MathWorks Inc., Natick, MA (2013)"},{"key":"7_CR19","unstructured":"Mattingley, J., Boyd, S.: CVXGEN: Code generation for convex optimization (2013). http:\/\/cvxgen.com\/docs\/index.html"},{"key":"7_CR20","unstructured":"Mosek ApS: Inner and outer lowner-john ellipsoids (2014). http:\/\/docs.mosek.com\/7.0\/matlabfusion\/Inner_and_outer_L_wner-John_Ellipsoids.html"},{"key":"7_CR21","unstructured":"Mosek ApS: The MOSEK optimization software (2014). http:\/\/www.mosek.com\/"},{"key":"7_CR22","unstructured":"Sarmiento, A., Murrieta-Cid, R., Hutchinson, S.: A sample-based convex cover for rapidly finding an object in a 3-d environment. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, (ICRA 2005). pp. 3486\u20133491. IEEE (2005). http:\/\/ieeexplore.ieee.org\/xpls\/abs_all.jsp?arnumber=1570649"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Sastry, S., Corti, D.S., Debenedetti, P.G., Stillinger, F.H.: Statistical geometry of particle packings.i.algorithm for exact determination of connectivity, volume, and surface areas of void space in monodisperse and polydisperse sphere packings. Phys. Rev. E 56(5), 5524\u20135532 (1997). http:\/\/link.aps.org\/doi\/10.1103\/PhysRevE.56.5524","DOI":"10.1103\/PhysRevE.56.5524"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundations of Robotics XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16595-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T16:25:19Z","timestamp":1674231919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16595-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319165943","9783319165950"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16595-0_7","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"value":"1610-7438","type":"print"},{"value":"1610-742X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"30 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}