{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:17:38Z","timestamp":1743002258753,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319544267"},{"type":"electronic","value":"9783319544274"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-54427-4_12","type":"book-chapter","created":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T04:16:53Z","timestamp":1489551413000},"page":"148-161","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Meta-Algorithm for Triangulation"],"prefix":"10.1007","author":[{"given":"Qianggong","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Tat-Jun","family":"Chin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,16]]},"reference":[{"key":"12_CR1","first-page":"1","volume":"52","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets. Discret. Comput. Geom. 52, 1\u201330 (2005)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, S., Snavely, N., Seitz, S.: Fast algorithms for $$l_\\infty $$ problems in multiview geometry. In: CVPR (2008)","DOI":"10.1109\/CVPR.2008.4587713"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF02574379","volume":"12","author":"N Amenta","year":"1994","unstructured":"Amenta, N.: Helly-type theorems and generalized linear programming. Discret. Comput. Geom. 12, 241\u2013261 (1994)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"KL Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las Vegas algorithms for linear and integer programming when the dimension is small. J. ACM 42, 488\u2013499 (1995)","journal-title":"J. ACM"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-33715-4_9","volume-title":"Computer Vision \u2013 ECCV 2012","author":"Z Dai","year":"2012","unstructured":"Dai, Z., Wu, Y., Zhang, F., Wang, H.: A novel fast method for $$L_{\\infty }$$ problems in multiview geometry. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012. LNCS, vol. 7576, pp. 116\u2013129. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33715-4_9"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13, 492\u2013498 (1967)","journal-title":"Manag. Sci."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Donn\u00e9, S., Goossens, B., Philips, W.: Point triangulation through polyhedrom collapse using the $$l_\\infty $$ norm. In: ICCV (2015)","DOI":"10.1109\/ICCV.2015.97"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Enqvist, O., Olsson, C., Kahl, F.: Stable structure from motion using rotational consistency. Technical report (2010)","DOI":"10.1109\/ICCVW.2011.6130252"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Eriksson, A., Isaksson, M.: Pseudoconvex proximal splitting for $$l_\\infty $$ problems in multiview geometry. In: CVPR (2014)","DOI":"10.1109\/CVPR.2014.518"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/TPAMI.2009.161","volume":"32","author":"Y Furukawa","year":"2010","unstructured":"Furukawa, Y., Ponce, J.: Accurate, dense, and robust multi-view stereopsis. IEEE TPAMI 32, 1362\u20131376 (2010)","journal-title":"IEEE TPAMI"},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"1493","DOI":"10.1287\/mnsc.42.10.1493","volume":"42","author":"M Gugat","year":"1996","unstructured":"Gugat, M.: A fast algorithm for a class of generalized fractional programs. Manag. Sci. 42, 1493\u20131499 (1996)","journal-title":"Manag. Sci."},{"key":"12_CR12","unstructured":"Hartley, R.I., Schaffalitzky, F.: $$l_\\infty $$ minimization in geometric reconstruction problems. In: CVPR (2004)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kahl, F.: Multiple view geometry and the $$l_\\infty $$ norm. In: ICCV (2005)","DOI":"10.1109\/ICCV.2005.163"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Ke, Q., Kanade, T.: Quasiconvex optimization for robust geometric reconstruction. In: ICCV (2005)","DOI":"10.1109\/ICCV.2005.197"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Li, H.: Efficient reduction of $$l_\\infty $$ geometry problems. In: CVPR (2009)","DOI":"10.1109\/CVPR.2009.5206653"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matou\u0161ek","year":"1996","unstructured":"Matou\u0161ek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16, 498\u2013516 (1996)","journal-title":"Algorithmica"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Mur-Artal, R., Tard\u00f3s, J.D.: Probabilistic semi-dense mapping from highly accurate feature-based monocular SLAM. In: RSS (2015)","DOI":"10.15607\/RSS.2015.XI.041"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-21227-7_49","volume-title":"Image Analysis","author":"C Olsson","year":"2011","unstructured":"Olsson, C., Enqvist, O.: Stable structure from motion for unordered image collections. In: Heyden, A., Kahl, F. (eds.) SCIA 2011. LNCS, vol. 6688, pp. 524\u2013535. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-21227-7_49"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Olsson, C., Eriksson, A., Kahl, F.: Efficient optimization for $$l_\\infty $$ problems using pseudoconvexity. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4409087"},{"key":"12_CR20","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF02574699","volume":"6","author":"R Seidel","year":"1991","unstructured":"Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discret. Comput. Geom. 6, 423\u2013434 (1991)","journal-title":"Discret. Comput. Geom."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Seo, Y., Hartley, R.I.: A fast method to minimize $$l_\\infty $$ error norm for geometric vision problems. In: ICCV (2007)","DOI":"10.1109\/ICCV.2007.4408913"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/3-540-55210-3_213","volume-title":"STACS 92","author":"M Sharir","year":"1992","unstructured":"Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 567\u2013579. Springer, Heidelberg (1992). doi: 10.1007\/3-540-55210-3_213"},{"key":"12_CR23","unstructured":"Sim, K., Hartley, R.: Removing outliers using the $$l_\\infty $$ norm. In: CVPR (2006)"},{"key":"12_CR24","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s11263-007-0107-3","volume":"80","author":"N Snavely","year":"2007","unstructured":"Snavely, N., Seitz, S.M., Szeliski, R.: Modeling the world from internet photo collections. IJCV 80, 189\u2013210 (2007)","journal-title":"IJCV"},{"key":"12_CR25","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2016 Workshops"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54427-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T15:03:42Z","timestamp":1568905422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54427-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319544267","9783319544274"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54427-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}