{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:48:02Z","timestamp":1729633682734,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1109\/iccitechnology.2013.6579526","type":"proceedings-article","created":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T17:11:36Z","timestamp":1377709896000},"page":"78-82","source":"Crossref","is-referenced-by-count":2,"title":["Geometric spanners: Recent results and open directions"],"prefix":"10.1109","author":[{"given":"Iyad","family":"Kanj","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/177424.177579"},{"journal-title":"The Yao Graph Y6 Is A Spanner","year":"2010","author":"o'rourke","key":"35"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054196000105"},{"key":"36","first-page":"207","article-title":"Approximating the d-dimensional complete euclidean graph","author":"ruppert","year":"1991","journal-title":"Proceedings of the 3rd Canadian Conference on Computational Geometry"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/160985.160998"},{"journal-title":"Minimum Dilation Triangulations for the Regular N-gon","year":"2004","author":"mulzer","key":"33"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-010-0264-0"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90044-5"},{"key":"39","article-title":"Toward the tight bound of the stretch factor of delaunay triangulations","author":"xia","year":"2011","journal-title":"Proceedings of the 23rd Annual Canadian Conference on Computational Geometry"},{"journal-title":"On Plane Geometric Spanners A Survey and Open Problems","year":"0","author":"bose","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195909002861"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-006-4469-5"},{"key":"11","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1137\/S0097539700369387","article-title":"Online routing in triangulations","volume":"33","author":"bose","year":"2004","journal-title":"SIAM Journal on Computing"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998235"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012319418150"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","author":"de berg","year":"2000","journal-title":"Computational Geometry Algorithms and Applications"},{"key":"20","first-page":"215","article-title":"A new way to weigh malnourished euclidean graphs","author":"das","year":"1995","journal-title":"Proceedings of the 6th Annual ACMSIAM Symposium on Discrete Algorithms"},{"key":"40","doi-asserted-by":"publisher","DOI":"10.1137\/0211059"},{"key":"22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02187801","article-title":"Delaunay graphs are almost as good as complete graphs","volume":"5","author":"dobkin","year":"1990","journal-title":"Discrete Computational Geometry"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700382947"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.142"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1137\/080737708"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.132"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.027"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187821"},{"key":"29","first-page":"51","article-title":"Compass routing on geometric networks","author":"kranakis","year":"1999","journal-title":"Proceeding of the 11th Canadian Conference on Computational Geometry"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16926-7_25"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.14"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1168-8"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02189308"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758846"},{"key":"7","first-page":"41","article-title":"On the stretch factor of convex delaunay graphs","volume":"1","author":"bose","year":"2010","journal-title":"Journal of Computational Geometry"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2012.03.004"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1239871"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_3"},{"key":"31","article-title":"Distributed construction of planar spanner and routing for ad hoc wireless networks","author":"li","year":"2002","journal-title":"Proceedings of the 21st IEEE International Conference on Computer Communications"},{"key":"4","first-page":"205","article-title":"The stretch factor of l1-and l!-delaunay triangulations","author":"bonichon","year":"2012","journal-title":"Proceedings of the 20th Annual European Symposium on Algorithms Volume 7501 of Lecture Notes in Computer Science"},{"key":"9","first-page":"234","article-title":"Constructing plane spanners of bounded degree and low weight","author":"bose","year":"2002","journal-title":"Proceedings of the 10th Annual European Symposium on Algorithms Volume 2461 of Lecture Notes in Computer Science"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195912600047"}],"event":{"name":"2013 International Conference on Communications and Information Technology (ICCIT)","start":{"date-parts":[[2013,6,19]]},"location":"Beirut, Lebanon","end":{"date-parts":[[2013,6,21]]}},"container-title":["2013 Third International Conference on Communications and Information Technology (ICCIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6573243\/6579508\/06579526.pdf?arnumber=6579526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T15:04:27Z","timestamp":1596380667000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6579526\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,6]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/iccitechnology.2013.6579526","relation":{},"subject":[],"published":{"date-parts":[[2013,6]]}}}