{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T06:01:37Z","timestamp":1740981697768,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192814"},{"type":"electronic","value":"9783642192821"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19282-1_51","type":"book-chapter","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T18:40:11Z","timestamp":1299004811000},"page":"641-652","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation Algorithm for Computing Minimum-Length Polygons in 3D Images"],"prefix":"10.1007","author":[{"given":"Fajie","family":"Li","sequence":"first","affiliation":[]},{"given":"Xiuxia","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"51_CR2","doi-asserted-by":"crossref","unstructured":"B\u00fclow, T., Klette, R.: Rubber band algorithm for estimating the length of digitized space-curves. In: Proc. Intern. Conf. Pattern Recognition, vol.\u00a03, pp. 551\u2013555 (2000)","DOI":"10.1109\/ICPR.2000.903604"},{"key":"51_CR3","series-title":"Lecture Notes in Computer Science","first-page":"281","volume-title":"Digital and Image Geometry","author":"T. B\u00fclow","year":"2002","unstructured":"B\u00fclow, T., Klette, R.: Approximation of 3D shortest polygons in simple cube curves. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol.\u00a02243, pp. 281\u2013294. Springer, Heidelberg (2002)"},{"key":"51_CR4","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/TPAMI.2002.1017622","volume":"24","author":"T. B\u00fclow","year":"2002","unstructured":"B\u00fclow, T., Klette, R.: Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence\u00a024, 962\u2013970 (2002)","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Canny, J., Reif, J.H.: New lower bound techniques for robot motion planning problems. In: Proc. IEEE Conf. Foundations Computer Science, pp. 49\u201360 (1987)","DOI":"10.1109\/SFCS.1987.42"},{"key":"51_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-45576-0_18","volume-title":"Digital and Image Geometry","author":"D. Coeurjolly","year":"2002","unstructured":"Coeurjolly, D., Debled-Rennesson, I., Teytaud, O.: Segmentation and length estimation of 3D discrete curves. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol.\u00a02243, pp. 299\u2013317. Springer, Heidelberg (2002)"},{"key":"51_CR7","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.: Touring a sequence of polygons. In: Proc. STOC, pp. 473\u2013482 (2003)","DOI":"10.1145\/780611.780612"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1109\/TITB.2005.855546","volume":"9","author":"E. Ficarra","year":"2005","unstructured":"Ficarra, E., Benini, L., Macii, E., Zuccheri, G.: Automated DNA fragments recognition and sizing through AFM image processing. IEEE Trans. Inf. Technol. Biomed.\u00a09, 508\u2013517 (2005)","journal-title":"IEEE Trans. Inf. Technol. Biomed."},{"key":"51_CR9","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"D.S. Hochbaum","year":"1997","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Pub. Co., Boston (1997)"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Jonas, A., Kiryati, N.: Length estimation in 3-D using cube quantization. In: Proc. Vision Geometry. SPIE, vol.\u00a02356, pp. 220\u2013230 (1994)","DOI":"10.1117\/12.198610"},{"key":"51_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/A:1008218517090","volume":"8","author":"A. Jonas","year":"1998","unstructured":"Jonas, A., Kiryati, N.: Length estimation in 3-D using cube quantization. J. Math. Imaging Vision\u00a08, 215\u2013238 (1998)","journal-title":"J. Math. Imaging Vision"},{"key":"51_CR12","unstructured":"Karavelas, M.I., Guibas, L.J.: Static and kinetic geometric spanners with applications. In: Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 168\u2013176 (2001)"},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-44438-6_38","volume-title":"Discrete Geometry for Computer Imagery","author":"R. Klette","year":"2000","unstructured":"Klette, R., B\u00fclow, T.: Minimum-length polygons in simple cube-curves. In: Nystr\u00f6m, I., Sanniti di Baja, G., Borgefors, G. (eds.) DGCI 2000. LNCS, vol.\u00a01953, p. 467. Springer, Heidelberg (2000)"},{"key":"51_CR14","volume-title":"Digital Geometry","author":"R. Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry. Morgan Kaufmann, San Francisco (2004)"},{"key":"51_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-30503-3_36","volume-title":"Combinatorial Image Analysis","author":"F. Li","year":"2004","unstructured":"Li, F., Klette, R.: Minimum-length polygon of a simple cube-curve in 3D space. In: Klette, R., \u017duni\u0107, J. (eds.) IWCIA 2004. LNCS, vol.\u00a03322, pp. 502\u2013511. Springer, Heidelberg (2004)"},{"key":"51_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-31965-8_18","volume-title":"Discrete Geometry for Computer Imagery","author":"F. Li","year":"2005","unstructured":"Li, F., Klette, R.: The class of simple cube-curves whose mLPs cannot have vertices at grid points. In: Andr\u00e8s, \u00c9., Damiand, G., Lienhardt, P. (eds.) DGCI 2005. LNCS, vol.\u00a03429, pp. 183\u2013194. Springer, Heidelberg (2005)"},{"key":"51_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/11556121_40","volume-title":"Computer Analysis of Images and Patterns","author":"F. Li","year":"2005","unstructured":"Li, F., Klette, R.: Minimum-length polygons of first-class simple cube-curves. In: Gagalowicz, A., Philips, W. (eds.) CAIP 2005. LNCS, vol.\u00a03691, pp. 321\u2013329. Springer, Heidelberg (2005)"},{"key":"51_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/11774938_33","volume-title":"Combinatorial Image Analysis","author":"F. Li","year":"2006","unstructured":"Li, F., Klette, R.: Shortest paths in a cuboidal world. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol.\u00a04040, pp. 415\u2013429. Springer, Heidelberg (2006)"},{"key":"51_CR19","unstructured":"Li, F., Klette, R.: Exact and approximate algorithms for the calculation of shortest paths. IMA Minneapolis (2006) , Report 2141 on http:\/\/www.ima.umn.edu\/preprints\/oct2006"},{"key":"51_CR20","doi-asserted-by":"publisher","first-page":"1588","DOI":"10.1016\/j.imavis.2006.06.021","volume":"25","author":"F. Li","year":"2007","unstructured":"Li, F., Klette, R.: Analysis of the rubberband algorithm. Image and Vision Computing\u00a025, 1588\u20131598 (2007)","journal-title":"Image and Vision Computing"},{"key":"51_CR21","volume-title":"Convex Functions","author":"A.W. Roberts","year":"1973","unstructured":"Roberts, A.W., Varberg, V.D.: Convex Functions. Academic Press, New York (1973)"},{"key":"51_CR22","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"51_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1109\/TSMC.1976.4309569","volume":"6","author":"J. Sklansky","year":"1976","unstructured":"Sklansky, J., Kibler, D.F.: A theory of nonuniformly digitized binary pictures. IEEE Trans. Systems Man Cybernetics\u00a06, 637\u2013647 (1976)","journal-title":"IEEE Trans. Systems Man Cybernetics"},{"key":"51_CR24","doi-asserted-by":"crossref","unstructured":"Sloboda, F., Za\u0165ko, B., Klette, R.: On the topology of grid continua. In: Proc. Vision Geometry. SPIE, vol.\u00a03454, pp. 52\u201363 (1998)","DOI":"10.1117\/12.323274"},{"key":"51_CR25","first-page":"113","volume-title":"Advances in Digital and Computational Geometry","author":"F. Sloboda","year":"1998","unstructured":"Sloboda, F., Za\u0165ko, B., Stoer, J.: On approximation of planar one-dimensional grid continua. In: Klette, R., Rosenfeld, A., Sloboda, F. (eds.) Advances in Digital and Computational Geometry, pp. 113\u2013160. Springer, Heidelberg (1998)"},{"key":"51_CR26","unstructured":"Sun, C., Pallottino, S.: Circular shortest path on regular grids. CSIRO Math. Information Sciences, CMIS Report No. 01\/76, Australia (2001)"},{"key":"51_CR27","first-page":"21","volume":"9","author":"M. Talbot","year":"2004","unstructured":"Talbot, M.: A dynamical programming solution for shortest path itineraries in robotics. Electr. J. Undergrad. Math.\u00a09, 21\u201335 (2004)","journal-title":"Electr. J. Undergrad. Math."},{"key":"51_CR28","first-page":"580","volume":"2","author":"R. Wolber","year":"2004","unstructured":"Wolber, R., St\u00e4b, F., Max, H., Wehmeyer, A., Hadshiew, I., Wenck, H., Rippke, F., Wittern, K.: Alpha-Glucosylrutin: Ein hochwirksams Flavonoid zum Schutz vor oxidativem Stress. J. German Society Dermatology\u00a02, 580\u2013587 (2004)","journal-title":"J. German Society Dermatology"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ACCV 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19282-1_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T02:20:15Z","timestamp":1740968415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19282-1_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192814","9783642192821"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19282-1_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}