{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T16:56:14Z","timestamp":1770828974678,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0010-4485(95)99797-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:58:05Z","timestamp":1027652285000},"page":"605-614","source":"Crossref","is-referenced-by-count":38,"title":["Representing the Voronoi diagram of a simple polygon using rational quadratic B\u00e9zier curves"],"prefix":"10.1016","volume":"27","author":[{"given":"Deok-Soo","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Il-Kyu","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bum-Joo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0010-4485(95)99797-C_BIB1","first-page":"345","author":"Aurenhammer","year":"1991"},{"key":"10.1016\/0010-4485(95)99797-C_BIB2","author":"Preparata","year":"1985"},{"key":"10.1016\/0010-4485(95)99797-C_BIB3","first-page":"1471","article-title":"Construction of the Voronoi diagram for \u2018one million\u2019 generators in single-precision arithmetic","volume":"Vol 80","author":"Sugihara","year":"1992"},{"key":"10.1016\/0010-4485(95)99797-C_BIB4","series-title":"Proc. Symp. Models for Perception of Speech & Visual Form","first-page":"362","article-title":"A transformation for extracting new descriptors of shape","author":"Blum","year":"1967"},{"key":"10.1016\/0010-4485(95)99797-C_BIB5","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0031-3203(78)90025-0","article-title":"Shape description using weighted symmetric axis features","volume":"Vol 10","author":"Blum","year":"1977","journal-title":"Pattern Recognition"},{"issue":"No 4","key":"10.1016\/0010-4485(95)99797-C_BIB6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TPAMI.1982.4767267","article-title":"Medial axis transformation of a planar shape","volume":"Vol PAMI-4","author":"Lee","year":"1982","journal-title":"IEEE Trans. Pattern Anal. & Mach. Intell."},{"key":"10.1016\/0010-4485(95)99797-C_BIB7","series-title":"16th Design Automation Conf.","first-page":"77","article-title":"Shape interrogation by medial axis transform","author":"Patrikalakis","year":"1990"},{"key":"10.1016\/0010-4485(95)99797-C_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01200364","article-title":"An automatic coarse and fine surface mesh generation scheme based on medial axis transform. Part I: Algorithms","volume":"Vol 8","author":"G\u00fcrsoy","year":"1992","journal-title":"Eng. Comput."},{"key":"10.1016\/0010-4485(95)99797-C_BIB9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01194321","article-title":"An automatic coarse and fine surface mesh generation scheme based on medial axis transform: Part II: Implementation","volume":"Vol 8","author":"G\u00fcrsoy","year":"1992","journal-title":"Eng. Comput."},{"key":"10.1016\/0010-4485(95)99797-C_BIB10","series-title":"Proc. 14th IEEE Symp. Foundations of Computer Science","first-page":"18","article-title":"Efficient computation of continuous skeletons","author":"Kirkpatrick","year":"1979"},{"key":"10.1016\/0010-4485(95)99797-C_BIB11","author":"Held","year":"1991"},{"issue":"No 3","key":"10.1016\/0010-4485(95)99797-C_BIB12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0010-4485(94)90042-6","article-title":"Pocket machining based on contour-parallel tool paths generated by means of proximity maps","volume":"Vol 26","author":"Held","year":"1994","journal-title":"Comput.-Aided Des."},{"issue":"No 3","key":"10.1016\/0010-4485(95)99797-C_BIB13","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0010-4485(78)90141-0","article-title":"NC machining of arbitrarily shaped pockets","volume":"Vol 10","author":"Persson","year":"1978","journal-title":"Comput.-Aided Des."},{"issue":"No 2","key":"10.1016\/0010-4485(95)99797-C_BIB14","first-page":"71","article-title":"Rolling discs and their applications","author":"Yang","year":"1992","journal-title":"J. Des. Mgf"},{"issue":"No 3","key":"10.1016\/0010-4485(95)99797-C_BIB15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1147\/rd.313.0361","article-title":"Voronoi diagram for multiply-connected polygonal domains. Part I: Algorithm","volume":"Vol 31","author":"Srinivasan","year":"1987","journal-title":"IBM J. Res. Develop."},{"issue":"No 3","key":"10.1016\/0010-4485(95)99797-C_BIB16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1147\/rd.313.0373","article-title":"Voronoi diagram for multiply-connected polygonal domains. Part II: Implementation and application","volume":"Vol 31","author":"Meshkat","year":"1987","journal-title":"IBM J. Res. Develop."},{"issue":"No 3","key":"10.1016\/0010-4485(95)99797-C_BIB17","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0262-8856(93)90055-L","article-title":"Euclidean skeleton via centre-of-maximal-disc extraction","volume":"Vol 11","author":"Arcelli","year":"1993","journal-title":"Image & Vision Comput."},{"issue":"No 1","key":"10.1016\/0010-4485(95)99797-C_BIB18","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1145\/138027.138040","article-title":"Generating automatically tuned bitmaps from outlines","volume":"Vol 40","author":"Hobby","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/0010-4485(95)99797-C_BIB19","series-title":"94 KIIE\/KORS Spring Joint Conf.","article-title":"Divide and conquer algorith for a Voronoi diagram of simple curves","author":"Kim","year":"1994"},{"key":"10.1016\/0010-4485(95)99797-C_BIB20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01840357","article-title":"A sweepline algorithm for Voronoi diagrams","volume":"Vol 2","author":"Fortune","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0010-4485(95)99797-C_BIB21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02187890","article-title":"An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments","volume":"Vol 2","author":"Yap","year":"1987","journal-title":"Discrete Comput. Geom."},{"issue":"No 4","key":"10.1016\/0010-4485(95)99797-C_BIB22","first-page":"468","article-title":"A simple method for avoiding numerical errors and degeneracy in Voronoi diagram construction","volume":"Vol E75-A","author":"Sugihara","year":"1992","journal-title":"IEICE Trans. Fundamentals"},{"key":"10.1016\/0010-4485(95)99797-C_BIB23","author":"Farin","year":"1990"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:001044859599797C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:001044859599797C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T01:55:21Z","timestamp":1555206921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/001044859599797C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":23,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["001044859599797C"],"URL":"https:\/\/doi.org\/10.1016\/0010-4485(95)99797-c","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}