{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:10:56Z","timestamp":1770743456965,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319261447","type":"print"},{"value":"9783319261454","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26145-4_4","type":"book-chapter","created":{"date-parts":[[2016,1,4]],"date-time":"2016-01-04T23:57:54Z","timestamp":1451951874000},"page":"46-60","source":"Crossref","is-referenced-by-count":2,"title":["Relative Convex Hull Determination from Convex Hulls in the Plane"],"prefix":"10.1007","author":[{"given":"Petra","family":"Wiederhold","sequence":"first","affiliation":[]},{"given":"Hugo","family":"Reyes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,6]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.ins.2012.05.029","volume":"216","author":"A Biswas","year":"2012","unstructured":"Biswas, A., Bhowmick, P., Sarkar, M., Bhattacharya, B.B.: A linear-time combinatorial algorithm to find the orthogonal hull of an object on the digital plane. Inf. Sci. 216, 176\u2013195 (2012)","journal-title":"Inf. Sci."},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/s00453-012-9679-6","volume":"68","author":"M Ishaque","year":"2014","unstructured":"Ishaque, M., Toth, C.D.: Relative convex hulls in semi-dynamic arrangements. Algorithmica 68(2), 448\u2013482 (2014)","journal-title":"Algorithmica"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Klette, G.: A recursive algorithm for calculating the relative convex hull. In: Proceedings of 25th International Conference on Image and Vision Computing, New Zealand, pp. 1-7. IEEE Computer Society (2010). doi:\n                      10.1109\/IVCNZ.2010.6148857\n                      \n                    , 978-1-4244-9631-0\/10","DOI":"10.1109\/IVCNZ.2010.6148857"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-19867-0_22","volume-title":"Discrete Geometry for Computer Imagery","author":"G Klette","year":"2011","unstructured":"Klette, G.: Recursive calculation of relative convex hulls. In: Debled-Rennesson, I., Domenjoud, E., Kerautret, B., Even, P. (eds.) DGCI 2011. LNCS, vol. 6607, pp. 260\u2013271. Springer, Heidelberg (2011)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1016\/j.cviu.2012.08.018","volume":"117","author":"G Klette","year":"2012","unstructured":"Klette, G.: Recursive computation of minimum-length polygons. Comput. Vis. Image Underst. 117, 386\u2013392 (2012)","journal-title":"Comput. Vis. Image Underst."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Klette, R., Kovalevsky, V., Yip, B.: On the length estimation of digital curves. In: SPIE Proceedings of Vision Geometry VIII, vol. 3811, pp. 117\u2013129. SPIE (1999)","DOI":"10.1117\/12.364118"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-45576-0_19","volume-title":"Digital and Image Geometry","author":"R Klette","year":"2002","unstructured":"Klette, R.: Multigrid convergence of geometric features. In: Bertrand, G., Imiya, A., Klette, R. (eds.) Digital and Image Geometry. LNCS, vol. 2243, pp. 318\u2013338. Springer, Heidelberg (2002)"},{"key":"4_CR8","volume-title":"Digital Geometry - Geometric Methods for Digital Picture Analysis","author":"R Klette","year":"2004","unstructured":"Klette, R., Rosenfeld, A.: Digital Geometry - Geometric Methods for Digital Picture Analysis. Morgan Kaufmann Publ., Elsevier, USA (2004)"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1111\/j.1365-2818.1981.tb01197.x","volume":"121","author":"C Lantuejoul","year":"1981","unstructured":"Lantuejoul, C., Beucher, S.: On the use of the geodesic metric in image analysis. J. Microsc. 121(1), 39\u201349 (1981)","journal-title":"J. Microsc."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0031-3203(84)90057-8","volume":"17","author":"C Lantuejoul","year":"1984","unstructured":"Lantuejoul, C., Maisonneuve, F.: Geodesic methods in quantitative image analysis. Pattern Recoglnition 17(2), 177\u2013187 (1984)","journal-title":"Pattern Recoglnition"},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2256-2","volume-title":"Euclidean Shortest Paths, Exact or Approximate Algorithms","author":"F Li","year":"2011","unstructured":"Li, F., Klette, R.: Euclidean Shortest Paths, Exact or Approximate Algorithms. Springer, London (2011)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0020-0190(87)90086-X","volume":"25","author":"A Melkman","year":"1987","unstructured":"Melkman, A.: On-line construction of the convex hull of a simple polyline. Inf. Process. Lett. 25, 11\u201312 (1987)","journal-title":"Inf. Process. Lett."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier, Amsterdam (2000)"},{"key":"4_CR14","volume-title":"Topology","author":"JR Munkres","year":"2000","unstructured":"Munkres, J.R.: Topology, 2nd edn. Prentice Hall, USA (2000)","edition":"2"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-04397-0_10","volume-title":"Discrete Geometry for Computer Imagery","author":"X Proven\u00e7al","year":"2009","unstructured":"Proven\u00e7al, X., Lachaud, J.-O.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol. 5810, pp. 104\u2013117. Springer, Heidelberg (2009)"},{"key":"4_CR16","unstructured":"Reyes Becerril, H.: Versi\u00f3n revisada de un algor\u00edtmo que determina la cubierta convexa relativa de pol\u00edgonos simples en el plano, Master Thesis. Dept. of Automatic Control, CINVESTAV-IPN, Mexico City, September 2013"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0262-8856(95)90839-Z","volume":"13","author":"L Robert","year":"1995","unstructured":"Robert, L., Faugeras, O.D.: Relative 3D positioning and 3D convex hull computation from a weakly calibrated stereo pair. Image Vis. Comput. 13(3), 189\u2013196 (1995)","journal-title":"Image Vis. Comput."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0031-3203(70)90037-3","volume":"2","author":"J Sklansky","year":"1970","unstructured":"Sklansky, J.: Recognition of convex blobs. Pattern Recognition 2, 3\u201310 (1970)","journal-title":"Pattern Recognition"},{"issue":"12","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1109\/T-C.1972.223507","volume":"C\u201321","author":"J Sklansky","year":"1972","unstructured":"Sklansky, J.: Measuring cavity on a rectangular mosaic. IEEE Trans. Comput. C\u201321(12), 1355\u20131364 (1972)","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"4_CR20","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. Syst. Man Cybern. 6(9), 637\u2013647 (1976)","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"4_CR21","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TC.1972.5008948","volume":"21","author":"J Sklansky","year":"1972","unstructured":"Sklansky, J., Chazin, R.L., Hansen, B.J.: Minimum perimeter polygons of digitized silhouettes. IEEE Trans. Comput. 21(3), 260\u2013268 (1972)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/0377-0427(94)90040-X","volume":"55","author":"F Sloboda","year":"1994","unstructured":"Sloboda, F., Stoer, J.: On piecewise linear approximation of planar Jordan curves. J. Comput. Appl. Math. 55, 369\u2013383 (1994)","journal-title":"J. Comput. Appl. Math."},{"key":"4_CR23","first-page":"113","volume-title":"Advances in Digital and Computational Geometry","author":"F Sloboda","year":"1998","unstructured":"Sloboda, F., Zatco, B., Stoer, J.: On approximation of planar one-dimensional continua. In: Klette, R., Rosenfeld, A., Sloboda, F. (eds.) Advances in Digital and Computational Geometry, pp. 113\u2013160. Springer, Singapore (1998)"},{"key":"4_CR24","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the relative convex hull of a set of points in a polygon. In: Proceedings of EURASIP, Signal Processing III: Theories and Applications, Part 2, pp. 853\u2013856. North-Holland (1986)"},{"key":"4_CR25","unstructured":"Toussaint, G.T.: Computing geodesic properties inside a simple polygon. Invited paper, Special Issue on Geometric Reasoning, Revue D\u2019Intelligence Artificielle 3(2), 9\u201342 (1989)"},{"issue":"1","key":"4_CR26","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02187729","volume":"4","author":"GT Toussaint","year":"1989","unstructured":"Toussaint, G.T.: On separating two simple polygons by a single translation. Discrete Comput. Geom. 4(1), 265\u2013278 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR27","unstructured":"Wiederhold, P., Villafuerte, M.: Triangulation of cross-sectional digital straights segments and minimum length polygons for surface area estimation. In: Wiederhold, P., Barneva, R.P. (eds.) Progress in Combinatorial Image Analysis, pp. 79\u201392. Research Publishing Services, Singapore (2009)"},{"key":"4_CR28","first-page":"131","volume":"1","author":"L Yu","year":"2002","unstructured":"Yu, L., Klette, R.: An approximative calculation of relative convex hulls for surface area estimation of 3D digital objects. ICPR 1, 131\u2013134 (2002)","journal-title":"ICPR"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26145-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T04:21:36Z","timestamp":1559362896000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26145-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319261447","9783319261454"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26145-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}