{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:07Z","timestamp":1725485587282},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413967"},{"type":"electronic","value":"9783540444381"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44438-6_37","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T18:43:17Z","timestamp":1181414597000},"page":"453-463","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Envelope of a Digital Curve Based on Dominant Points"],"prefix":"10.1007","author":[{"given":"David E.","family":"Singh","sequence":"first","affiliation":[]},{"given":"Mar\u00eda J.","family":"Mart\u00edn","sequence":"additional","affiliation":[]},{"given":"Francisco F.","family":"Rivera","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, J. Park: Notes on Searching in Multidimensional Monotone Arrays. Proc. 29th IEEE Symp. on Found. of Comp. Sci. (1988), 497\u2013512 453","DOI":"10.1109\/SFCS.1988.21966"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/0196-6774(86)90007-6","volume":"7","author":"J. O\u2019Rourke","year":"1986","unstructured":"J. O\u2019Rourke, A. Aggarwal, S. Maddial, M. Baldwin: An optimal algorithm for finding enclosing triangles. J. Algorithms, 7 (1986) 258\u2013269 453","journal-title":"J. Algorithms"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/BF01898354","volume":"1","author":"A. Aggarwal","year":"1985","unstructured":"A. Aggarwal, J. Chang, C. Yap: Minimum Area Circumscribing Polygons. Visual Computer, 1 (1985), 112\u2013117 453","journal-title":"Visual Computer"},{"key":"37_CR4","unstructured":"A. DePano, A. Aggarwal: Finding restricted k-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing, (1984) 81\u201390 453"},{"key":"37_CR5","unstructured":"DavidM. Mount, Ruth Silverman: Minimum enclosures with specified angles. Technical Report, CS-TR-3219 (1994) 453"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/TPAMI.1986.4767753","volume":"8\u20131","author":"J. G. Dunham","year":"1986","unstructured":"J. G. Dunham: Optimum Uniform Piecewise Linear Approximation of Planar Curves. IEEE Trans. Pattern Anal. and Machine Intelligence, V. 8\u20131, (1986) 67\u201375 453","journal-title":"IEEE Trans. Pattern Anal. and Machine Intelligence"},{"issue":"6","key":"37_CR7","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/34.601253","volume":"19","author":"P. L. Rosin","year":"1997","unstructured":"Paul L. Rosin: Techniques for Assessing polygonal approximations of curves. IEEE Trans. on Pattern Anal. and Machine Intelligence, Vol 19, No 6 (1997) 659\u2013666 453","journal-title":"IEEE Trans. on Pattern Anal. and Machine Intelligence"},{"issue":"3","key":"37_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1037\/h0054663","volume":"61","author":"F. Attneave","year":"1954","unstructured":"F. Attneave: Some informational aspects of visual perception. Psychol. Review. vol 61, no 3, (1954) 183\u2013193 454","journal-title":"Psychol. Review."},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0167-8655(93)90116-U","volume":"14","author":"M. S. Kankanhalli","year":"1993","unstructured":"Mohan S. Kankanhalli: An adaptive dominant point detection algorithm for digital curves. Pattern Recognition Letters. 14 (1993) 385\u2013390 454","journal-title":"Pattern Recognition Letters"},{"issue":"8","key":"37_CR10","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/34.31447","volume":"11","author":"C.-H. Teh","year":"1989","unstructured":"Cho-Huak Teh, Roland T. Chin: On the detection of dominant points. IEEE Trans. on Pattern Anal. and Machine Intelligence. Vol 11. No 8 (1989) 859\u2013872 454","journal-title":"IEEE Trans. on Pattern Anal. and Machine Intelligence"},{"key":"37_CR11","unstructured":"Isabelle Debled-Rennesson, Jean-Pierre Reveill\u00e8s: A linear algorithm for segmentation of digital curves. Int. J. of Pattern Recog. and Artificial Intelligence. 9\u20136 (1995) 454"},{"key":"37_CR12","unstructured":"David E. Singh, Mar\u00eda J. Mart\u00edn, Francisco F. Rivera: Propiedades geom\u00e9tricas en la obtenci\u00f3n de la envolvente a una curva digital. Tech. report. (1999) 456, 457, 460, 461"}],"container-title":["Lecture Notes in Computer Science","Discrete Geometry for Computer Imagery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44438-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:54:32Z","timestamp":1558274072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44438-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413967","9783540444381"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44438-6_37","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"1 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}