{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T12:07:43Z","timestamp":1759147663314,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,7,26]],"date-time":"2009-07-26T00:00:00Z","timestamp":1248566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["NSC 97-2221-E-002-216-MY3"],"award-info":[{"award-number":["NSC 97-2221-E-002-216-MY3"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Excellent Research Projects of National Taiwan University","award":["95R0062-AE00-05"],"award-info":[{"award-number":["95R0062-AE00-05"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,7,26]]},"DOI":"10.1145\/1629911.1629998","type":"proceedings-article","created":{"date-parts":[[2009,10,13]],"date-time":"2009-10-13T15:11:11Z","timestamp":1255446671000},"page":"314-319","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["An O(n log n) path-based obstacle-avoiding algorithm for rectilinear Steiner tree construction"],"prefix":"10.1145","author":[{"given":"Chih-Hung","family":"Liu","sequence":"first","affiliation":[{"name":"National Taiwan University"}]},{"given":"Shih-Yi","family":"Yuan","sequence":"additional","affiliation":[{"name":"Feng Chia University"}]},{"given":"Sy-Yen","family":"Kuo","sequence":"additional","affiliation":[{"name":"National Taiwan University"}]},{"given":"Yao-Hsin","family":"Chou","sequence":"additional","affiliation":[{"name":"National Taiwan University"}]}],"member":"320","published-online":{"date-parts":[[2009,7,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2005.45"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123020"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146909.1147011"},{"key":"e_1_3_2_1_4_1","first-page":"262","article-title":"A fast and stable algorithm for obstacle-avoiding rectilinear Steiner minimal tree","author":"Wu P. C.","year":"2007","unstructured":"P. C. Wu , J. R. Gao , and T. W. Wang , \" A fast and stable algorithm for obstacle-avoiding rectilinear Steiner minimal tree ,\" in Proc. ASP-DAC , pp. 262 -- 267 , 2007 . P. C. Wu, J. R. Gao, and T. W. Wang, \"A fast and stable algorithm for obstacle-avoiding rectilinear Steiner minimal tree,\" in Proc. ASP-DAC, pp. 262--267, 2007.","journal-title":"Proc. ASP-DAC"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.917583"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.2006098"},{"key":"e_1_3_2_1_7_1","volume-title":"ICCAD","author":"Li L.","year":"2008","unstructured":"L. Li and Evangeline F. Y . Young, \"Obstacle-avoiding rectilinear steiner tree construction,\" in Proc . ICCAD , 2008 . L. Li and Evangeline F. Y. Young, \"Obstacle-avoiding rectilinear steiner tree construction,\" in Proc. ICCAD, 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/0132071"},{"key":"e_1_3_2_1_9_1","unstructured":"International Technology Roadmap for Semiconductors (ITRS) 2007 http:\/\/www.itrs.net. International Technology Roadmap for Semiconductors (ITRS) 2007 http:\/\/www.itrs.net."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1233501.1233596"},{"key":"e_1_3_2_1_11_1","first-page":"630","volume-title":"ASIC","author":"Yang Y.","year":"2003","unstructured":"Y. Yang , Q. Zhu , T. Jing , X. Hong , and Y. Wang , \" Rectilinear steiner minimal trees among obstacles,\" in Proc . ASIC , pp. 630 -- 635 , 2003 . Y. Yang, Q. Zhu, T. Jing, X. Hong, and Y. Wang, \"Rectilinear steiner minimal trees among obstacles,\" in Proc. ASIC, pp. 630--635, 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758836"},{"key":"e_1_3_2_1_13_1","volume-title":"CCCG","author":"Mitchell J. S. B.","year":"1989","unstructured":"J. S. B. Mitchell , \"An optimal algorithm for shortest rectilinear paths among obstacles,\" in Proc . CCCG , 1989 . J. S. B. Mitchell, \"An optimal algorithm for shortest rectilinear paths among obstacles,\" in Proc. CCCG, 1989."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"de Berg M.","year":"2000","unstructured":"M. de Berg , M. van Kreveld , M. Overmars , and O. Schwarzkopf , Computational Geometry: Algorithms and Applications , 2 nd edition, Springer , 2000 . M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry: Algorithms and Applications, 2nd edition, Springer, 2000.","edition":"2"},{"key":"e_1_3_2_1_15_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"2001","unstructured":"T. Cormen , C. Leiserson , R. Rivest , and C. Stein , Introduction to Algorithms , 2 nd edition, The MIT Press , 2001 . T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition, The MIT Press, 2001.","edition":"2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762115"}],"event":{"name":"DAC '09: The 46th Annual Design Automation Conference 2009","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CAS Circuits & Systems"],"location":"San Francisco California","acronym":"DAC '09"},"container-title":["Proceedings of the 46th Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1629911.1629998","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1629911.1629998","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:23:16Z","timestamp":1750249396000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1629911.1629998"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,26]]},"references-count":16,"alternative-id":["10.1145\/1629911.1629998","10.1145\/1629911"],"URL":"https:\/\/doi.org\/10.1145\/1629911.1629998","relation":{},"subject":[],"published":{"date-parts":[[2009,7,26]]},"assertion":[{"value":"2009-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}