{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:23:39Z","timestamp":1725798219512},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_32","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T18:17:11Z","timestamp":1406830631000},"page":"198-205","source":"Crossref","is-referenced-by-count":2,"title":["Implementing the L \u2009\u221e\u2009 Segment Voronoi Diagram in CGAL and Applying in VLSI Pattern Analysis"],"prefix":"10.1007","author":[{"given":"Panagiotis","family":"Cheilaris","sequence":"first","affiliation":[]},{"given":"Sandeep Kumar","family":"Dey","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Gabrani","sequence":"additional","affiliation":[]},{"given":"Evanthia","family":"Papadopoulou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Abdo, A., Viswanathan, R.: The feasibility of using image parameters for test pattern selection during OPC model calibration. In: Proc. SPIE, vol.\u00a07640, p. 76401E (2010)","DOI":"10.1117\/12.846686"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-61332-3_144","volume-title":"Computing and Combinatorics","author":"O. Aichholzer","year":"1996","unstructured":"Aichholzer, O., Aurenhammer, F.: Straight skeletons for general polygonal figures in the plane. In: Cai, J.-Y., Wong, C.K. (eds.) COCOON 1996. LNCS, vol.\u00a01090, pp. 117\u2013126. Springer, Heidelberg (1996)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Klein, R., Lee, D.T.: Voronoi Diagrams and Delaunay Triangulations. World Scientific Publishing Company, Singapore (2013)","DOI":"10.1142\/8685"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BFb0049411","volume-title":"Algorithms - ESA \u201994","author":"C. Burnikel","year":"1994","unstructured":"Burnikel, C., Mehlhorn, K., Schirra, S.: How to compute the Voronoi diagram of line segments: Theoretical and experimental results. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 227\u2013239. Springer, Heidelberg (1994)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054102001035","volume":"13","author":"O. Devillers","year":"2002","unstructured":"Devillers, O.: The Delaunay hierarchy. International Journal of Foundations of Computer Science\u00a013, 163\u2013180 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"32_CR6","unstructured":"Karavelas, M.: A robust and efficient implementation for the segment Voronoi diagram. In: International Symposium on Voronoi Diagrams in Science and Engineering, pp. 51\u201362 (2004)"},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539796305365","volume":"28","author":"G. Liotta","year":"1998","unstructured":"Liotta, G., Preparata, F.P., Tamassia, R.: Robust proximity queries: An illustration of degree-driven algorithm design. SIAM Journal on Computing\u00a028(3), 864\u2013889 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"32_CR8","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TCAD.2010.2100550","volume":"30","author":"E. Papadopoulou","year":"2011","unstructured":"Papadopoulou, E.: Net-aware critical area extraction for opens in VLSI circuits via higher-order Voronoi diagrams. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems\u00a030(5), 704\u2013716 (2011)","journal-title":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"},{"issue":"5","key":"32_CR9","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1142\/S0218195901000626","volume":"11","author":"E. Papadopoulou","year":"2001","unstructured":"Papadopoulou, E., Lee, D.T.: The L\n                  \u2009\u221e\u2009 Voronoi diagram of segments and VLSI applications. International Journal of Computational Geometry and Application\u00a011(5), 502\u2013528 (2001)","journal-title":"International Journal of Computational Geometry and Application"},{"key":"32_CR10","unstructured":"Voronoi CAA: Voronoi Critical Area Analysis. IBM CAD Tool, Department of Electronic Design Automation, IBM Microelectronics Division, Burlington, VT, initial patents: US6178539, US6317859"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Yap, C., Dub\u00e9, T.: The exact computation paradigm. In: Computing in Euclidean Geometry, pp. 452\u2013492 (1994)","DOI":"10.1142\/9789812831699_0011"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T09:27:54Z","timestamp":1558949274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}