{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:37Z","timestamp":1725497257077},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_62","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"716-727","source":"Crossref","is-referenced-by-count":3,"title":["Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction"],"prefix":"10.1007","author":[{"given":"Evanthia","family":"Papadopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"62_CR1","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1109\/43.752929","volume":"18","author":"E. Papadopoulou","year":"1999","unstructured":"Papadopoulou, E., Lee, D.T.: Critical area computation via Voronoi diagrams. IEEE Transactions on Computer-Aided Design\u00a018(4), 463\u2013474 (1999)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"issue":"5","key":"62_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1109\/43.920683","volume":"20","author":"E. Papadopoulou","year":"2001","unstructured":"Papadopoulou, E.: Critical area computation for missing material defects in VLSI circuits. IEEE Transactions on Computer-Aided Design\u00a020(5), 583\u2013597 (2001)","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"62_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00453-004-1095-0","volume":"40","author":"E. Papadopoulou","year":"2004","unstructured":"Papadopoulou, E.: The Hausdorff Voronoi diagram of point clusters in the plane. Algorithmica\u00a040, 63\u201382 (2004)","journal-title":"Algorithmica"},{"issue":"2","key":"62_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/66.388016","volume":"8","author":"C.H. Stapper","year":"1995","unstructured":"Stapper, C.H., Rosner, R.J.: Integrated circuit yield management and yield analysis: Development and implementation. IEEE Trans. Semiconductor Manufacturing\u00a08(2), 95\u2013102 (1995)","journal-title":"IEEE Trans. Semiconductor Manufacturing"},{"issue":"4","key":"62_CR5","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1147\/rd.284.0461","volume":"28","author":"C.H. Stapper","year":"1984","unstructured":"Stapper, C.H.: Modeling of defects in integrated circuit photolithographic patterns. IBM J. Res. Develop.\u00a028(4), 461\u2013475 (1984)","journal-title":"IBM J. Res. Develop."},{"issue":"4","key":"62_CR6","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1109\/JSSC.1985.1052404","volume":"20","author":"A. Ferris-Prabhu","year":"1985","unstructured":"Ferris-Prabhu, A.: Defect size variations and their effect on the critical area of VLSI devices. IEEE J. of Solid State Circuits\u00a020(4), 878\u2013880 (1985)","journal-title":"IEEE J. of Solid State Circuits"},{"issue":"1","key":"62_CR7","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/TCAD.2003.819426","volume":"23","author":"A.B. Kahng","year":"2004","unstructured":"Kahng, A.B., Liu, B., Mandoiu, I.I.: Non-tree routing for reliability and yield improvement. IEEE Trans. on Comp. Aided Design of Integrated Circuits and Systems\u00a023(1), 148\u2013156 (2004)","journal-title":"IEEE Trans. on Comp. Aided Design of Integrated Circuits and Systems"},{"doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Drysdale, R., Krasser, H.: Farthest line segment Voronoi diagrams. Information Processing Letters (100), 220\u2013225 (2006)","key":"62_CR8","DOI":"10.1016\/j.ipl.2006.07.008"},{"issue":"5","key":"62_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1142\/S0218195901000626","volume":"11","author":"E. Papadopoulou","year":"2001","unstructured":"Papadopoulou, E., Lee, D.: The l \u2009\u221e\u2009 Voronoi diagram of segments and VLSI applications. International Journal of Computational Geometry and Applications\u00a011(5), 503\u2013528 (2001)","journal-title":"International Journal of Computational Geometry and Applications"},{"unstructured":"Maynard, D.N., Hibbeler, J.D.: Measurement and reduction of critical area using Voronoi diagrams. In: Advanced Semiconductor Manufacturing IEEE Conference and Workshop (2005)","key":"62_CR10"},{"issue":"6","key":"62_CR11","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1109\/TC.1982.1676031","volume":"C-31","author":"D.T. Lee","year":"1982","unstructured":"Lee, D.T.: On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput.\u00a0C-31(6), 478\u2013487 (1982)","journal-title":"IEEE Trans. Comput."},{"key":"62_CR12","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM Journal on Computing\u00a01, 146\u2013160 (1972)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"62_CR13","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Comm. ACM\u00a016(6), 372\u2013378 (1973)","journal-title":"Comm. ACM"},{"key":"62_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/BF02187788","volume":"5","author":"F. Aurenhammer","year":"1990","unstructured":"Aurenhammer, F.: A new duality result concerning Voronoi diagrams. Discrete and Cpomputational Geometry\u00a05, 243\u2013254 (1990)","journal-title":"Discrete and Cpomputational Geometry"},{"key":"62_CR15","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1109\/TC.1987.5009474","volume":"C-36","author":"B. Chazelle","year":"1987","unstructured":"Chazelle, B., Edelsbrunner, H.: An improved algorithm for constructing kth order Voronoi diagrams. IEEE Transactions on Computers\u00a0C-36, 1349\u20131354 (1987)","journal-title":"IEEE Transactions on Computers"},{"key":"62_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Dividing a graph into triconnected components. SIAM Journal on Computing\u00a02, 135\u2013158 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"62_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/B978-044482537-7\/50006-1","volume-title":"Handbook of Computational Geometry","author":"F. Aurenhammer","year":"2000","unstructured":"Aurenhammer, F., Klein, R.: Voronoi diagrams. In: Sack, J., Urrutia, G. (eds.) Handbook of Computational Geometry, pp. 201\u2013290. Elsevier, Amsterdam (2000)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:01:23Z","timestamp":1619521283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_62","relation":{},"subject":[]}}