{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T12:57:58Z","timestamp":1792069078728,"version":"4.4.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540605737","type":"print"},{"value":"9783540477662","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015444","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:50:06Z","timestamp":1131846606000},"page":"382-391","source":"Crossref","is-referenced-by-count":31,"title":["Finding the medial axis of a simple polygon in linear time"],"prefix":"10.1007","author":[{"given":"Francis","family":"Chin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jack","family":"Snoeyink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cao An","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A. Aggarwal","year":"1989","unstructured":"A. Aggarwal, L. J. Guibas, J. Saxe, and P. W. Shor. A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Disc. & Comp. Geom., 4:591\u2013604, 1989.","journal-title":"Disc. & Comp. Geom."},{"issue":"3","key":"43_CR2","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F. Aurenhammer","year":"1991","unstructured":"F. Aurenhammer. Voronoi diagrams\u2013A survey of a fundamental geometric data structure. ACM Comp. Surveys, 23(3):345\u2013405, 1991.","journal-title":"ACM Comp. Surveys"},{"key":"43_CR3","unstructured":"H. Blum. A transformation for extracting new descriptors of shape. In W. Whaten-Dunn, editor, Proc. Symp. Models for Perception of Speech and Visual Form, pages 362\u2013380. MIT Press, 1967."},{"key":"43_CR4","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B. Chazelle","year":"1991","unstructured":"B. Chazelle. Triangulating a simple polygon in linear time. Disc. & Comp. Geom., 6:485\u2013524, 1991.","journal-title":"Disc. & Comp. Geom."},{"issue":"1","key":"43_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1142\/S021819599200007X","volume":"2","author":"O. Devillers","year":"1992","unstructured":"O. Devillers. Randomization yields simple O(n log* n) algorithms for difficult \u03a9(n) problems. Int. J. Comp. Geom. App., 2(1):97\u2013111, 1992.","journal-title":"Int. J. Comp. Geom. App."},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"H. Djidjev and A. Lingas. On computing the Voronoi diagram for restricted planar figures. In WADS '91: Second Workshop on Data Structures and Algorithms, number 519 in LNCS, pages 54\u201364. Springer-Verlag, 1991.","DOI":"10.1007\/BFb0028250"},{"key":"43_CR7","unstructured":"R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley & Sons, 1973."},{"key":"43_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01200364","volume":"8","author":"H. N. G\u00fcrsoy","year":"1992","unstructured":"H. N. G\u00fcrsoy and N. M. Patrikalakis. An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part I algorithm. Engineering with Computers, 8:121\u2013137, 1992.","journal-title":"Engineering with Computers"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"M. Held. On the Computational Geometry of Pocket Machining. Number 500 in LNCS. Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54103-9"},{"key":"43_CR10","unstructured":"D. G. Kirkpatrick. Efficient computation of continuous skeletons. In Proc. 18th FOCS, pages 162\u2013170, 1977."},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"R. Klein and A. Lingas. A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon. In Proc. 9th Ann. ACM Symp. Comp. Geom., pages 124\u2013132, 1993.","DOI":"10.1145\/160985.161008"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"R. Klein and A. Lingas. Fast skeleton construction. To appear, Proc. 3rd Europ. Symp. on Alg. (ESA '95), 1995.","DOI":"10.1007\/3-540-60313-1_172"},{"issue":"4","key":"43_CR13","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","volume":"PAMI-4","author":"D. T. Lee","year":"1982","unstructured":"D. T. Lee. Medial axis transformation of a planar shape. IEEE Trans. Pat. Anal. Mach. Int., PAMI-4(4):363\u2013369, 1982.","journal-title":"IEEE Trans. Pat. Anal. Mach. Int."},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"S. Lu, H. Xu, and C. Wang. Detecting and eliminating false strokes in skeletons by geometric analysis. In SPIE's OE\/Technology'92, Vision Geometry, Boston, Nov. 1992.","DOI":"10.1117\/12.142180"},{"key":"43_CR15","unstructured":"A. Okabe, B. Boots, and K. Sugihara. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, 1992."},{"key":"43_CR16","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0734-189X(86)90113-1","volume":"33","author":"A. Rosenfeld","year":"1986","unstructured":"A. Rosenfeld. Axial representation of shape. Comp. Vis. Graph. Image Proc., 33:156\u2013173, 1986.","journal-title":"Comp. Vis. Graph. Image Proc."},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey. Closest point problems. In Proc. 16th FOCS, pages 151\u2013162, 1975.","DOI":"10.1109\/SFCS.1975.8"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"P. Vermeer. Two-dimensional mat to boundary conversion. In Proc. 2nd Symp. Solid Model. Appl., pages 493\u2013494, 1993.","DOI":"10.1145\/164360.164548"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"C. A. Wang and F. Chin. Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time. To appear, Proc. 3rd Europ. Symp. on Alg. (ESA '95), 1995.","DOI":"10.1007\/3-540-60313-1_150"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T16:49:57Z","timestamp":1586537397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015444"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0015444","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}