{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T05:50:26Z","timestamp":1717048226382},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T00:00:00Z","timestamp":1194912000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s11276-007-0078-x","type":"journal-article","created":{"date-parts":[[2007,11,12]],"date-time":"2007-11-12T16:18:44Z","timestamp":1194884324000},"page":"845-858","source":"Crossref","is-referenced-by-count":3,"title":["Single-step creation of localized Delaunay triangulations"],"prefix":"10.1007","volume":"15","author":[{"given":"Filipe","family":"Araujo","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,13]]},"reference":[{"key":"78_CR1","unstructured":"Araujo, F., & Rodrigues, L. (2004). Fast localized delaunay triangulation. In The 8th International Conference on Principles of Distributed Systems (OPODIS 2004) (pp. 81\u201393). Grenoble: Springer-Verlag, LNCS 3544."},{"key":"78_CR2","unstructured":"Araujo, F., & Rodrigues, L. (2006). Single-step creation of localized delaunay triangulations. Technical Report TR 06\/03, Centre of Informatics and Systems of the University of Coimbra, ISSN 0874-338X."},{"key":"78_CR3","unstructured":"Avin, C. (2005). Fast and efficient restricted delaunay triangulation in random geometric graphs. In Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2005)."},{"key":"78_CR4","doi-asserted-by":"crossref","unstructured":"Bhardwaj, M., Chandrakasan, A., & Garnett, T. (2001). Upper bounds on the lifetime of sensor networks. In IEEE International Conference on Communications (pp. 785\u2013790).","DOI":"10.1109\/ICC.2001.937346"},{"issue":"2","key":"78_CR5","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(93)90024-N","volume":"112","author":"J.-D. Boissonnat","year":"1993","unstructured":"Boissonnat, J.-D., & Teillaud, M. (1993). On the randomized construction of the Delaunay tree. Theoretical Computer Science, 112(2), 339\u2013354.","journal-title":"Theoretical Computer Science"},{"key":"78_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"Bondy, J. A., & Murty, U. S. R. (1976). Graph Theory with Applications. North-Holland: Elsevier."},{"key":"78_CR7","doi-asserted-by":"crossref","unstructured":"Bose, P., & Morin, P. (1999). Online routing in triangulations. In 10th Annual Internation Symposium on Algorithms and Computation (ISAAC).","DOI":"10.1007\/3-540-46632-0_12"},{"key":"78_CR8","doi-asserted-by":"crossref","unstructured":"Bose, P., Morin, P., Stojmenovic, I., & Urrutia, J. (1999). Routing with guaranteed delivery in ad hoc wireless networks. In International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM) (pp. 48\u201355).","DOI":"10.1145\/313239.313282"},{"key":"78_CR9","doi-asserted-by":"crossref","unstructured":"Dobkin, D., Friedman, S. J., & Supowit, K. J. (1990). Delaunay graphs are almost as good as complete graphs. Discrete Computational Geometry, 5(1), 399\u2013407.","DOI":"10.1007\/BF02187801"},{"key":"78_CR10","doi-asserted-by":"crossref","unstructured":"Eppstein, D. (2000). Spanning trees and spanners. In Handbook of Computational Geometry (pp. 425\u2013461). North-Holland: Elsevier.","DOI":"10.1016\/B978-044482537-7\/50010-3"},{"key":"78_CR11","doi-asserted-by":"crossref","unstructured":"Finn, G. (1987). Routing and addressing problems in large metropolitan-scale internetworks. Technical Report ISU\/RR-87-180, Institute for Scientific Information, March.","DOI":"10.21236\/ADA180187"},{"key":"78_CR12","doi-asserted-by":"crossref","unstructured":"Fortune, S. (1987). A sweepline algorithm for Voronoi diagrams. Algorithmica, 2, 153\u2013174.","DOI":"10.1007\/BF01840357"},{"key":"78_CR13","doi-asserted-by":"crossref","unstructured":"Frey, H., & Stojmenovic, I. (2006). On delivery guarantees of face and combined greedy-face routing in ad hoc and sensor networks. In MobiCom \u201906: Proceedings of the 12th Annual International Conference on Mobile Computing and Networking (pp. 390\u2013401). New York: ACM Press.","DOI":"10.1145\/1161089.1161133"},{"key":"78_CR14","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L., Hershberger, J., Zhang, L., & Zhu, A. (2001). Geometric spanners for routing in mobile networks. In 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 01).","DOI":"10.1145\/501416.501424"},{"key":"78_CR15","unstructured":"Karp, B., & Kung, H. (2000). GPRS: Greedy perimeter stateless routing for wireless networks. In ACM\/IEEE International Conference on Mobile Computing and Networking."},{"key":"78_CR16","doi-asserted-by":"crossref","unstructured":"Kim, Y.-J., Govindan, R., Karp, B., & Shenker, S. (2005). On the pitfalls of geographic face routing. In DIALM-POMC \u201905: Proceedings of the 2005 Joint Workshop on Foundations of Mobile Computing (pp. 34\u201343). New York: ACM Press.","DOI":"10.1145\/1080810.1080818"},{"key":"78_CR17","doi-asserted-by":"crossref","unstructured":"Kozma, G., Lotker, Z., Sharir, M., & Stupp, G. (2004). Geometrically aware communication in random wireless networks. In PODC \u201904: Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing (pp. 310\u2013319). New York: ACM Press.","DOI":"10.1145\/1011767.1011813"},{"key":"78_CR18","unstructured":"Kranakis, E., Singh, H., & Urrutia, J. (1999). Compass routing on geometric networks. In 11th Canadian Conference on Computation Geometry (CCCG 99)."},{"key":"78_CR19","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zhang, Y., & Zollinger, A. (2003). Geometric ad-hoc routing: Of theory and practice. In 22nd ACM Symposium on the Principles of Distributed Computing (PODC 2003), Boston, July.","DOI":"10.1145\/872035.872044"},{"key":"78_CR20","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., & Zollinger, A. (2002). Asymptotically optimal geometric mobile ad-hoc routing. In 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM\u201902).","DOI":"10.1145\/570810.570814"},{"key":"78_CR21","unstructured":"Lan, L., & Wen-Jing, H. (2002). Localized Delaunay triangulation for topological construction and routing on manets. In 2nd ACM Workshop on Principles of Mobile Computing (POMC\u201902)."},{"issue":"3","key":"78_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D.-T. Lee","year":"1980","unstructured":"Lee, D.-T., & Schachter, B. (1980). Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences, 9(3), 219\u2013242","journal-title":"International Journal of Computer and Information Sciences"},{"key":"78_CR23","unstructured":"Li, X.-Y., Calinescu, G., & Wan, P.-J. (2002). Distributed construction of a planar spanner and routing for ad hoc wireless networks. In The 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)."},{"issue":"9","key":"78_CR24","first-page":"1035","volume":"14","author":"X.-Y. Li","year":"2003","unstructured":"Li, X.-Y., Calinescu, G., Wan, P.-Jun, & Wang, Y. (2003). Localized delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems, 14(9), 1035\u20131047.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"78_CR25","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1109\/TPDS.2004.1271184","volume":"15","author":"X.-Y. Li","year":"2004","unstructured":"Li, X.-Y., Stojmenovic, I., & Wang, Y. (2004). Partial delaunay triangulation and degree limited localized bluetooth scatternet formation. IEEE Transactions on Parallel and Distributed Systems, 15(4), 350\u2013361.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"78_CR26","unstructured":"Liebeherr, J., Nahas, M., & Si, W. (2001). Application-layer multicasting with Delaunay triangulation overlays. Technical Report CS-2001-26, University of Virginia, Department of Computer Science, Charlottesville, VA 22904, 5."},{"key":"78_CR27","unstructured":"Lynch, N. (1996). Distributed algorithms. In Data Link Protocols (Chap. 16, pp. 691\u2013732). Morgan-Kaufmann."},{"key":"78_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"Preparata, F. P., & Shamos, M. I. (1985). Computational Geometry: An Introduction. New York: Springer-Verlag."},{"key":"78_CR29","doi-asserted-by":"crossref","unstructured":"Rodoplu, V., & Meng, T. (1998). Minimum energy mobile wireless networks. In 1998 IEEE International Conference on Communications, ICC\u201998 (Vol. 3, pp. 1633\u20131639). Atlanta, June.","DOI":"10.1109\/ICC.1998.683107"},{"issue":"3","key":"78_CR30","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1093\/comjnl\/21.3.243","volume":"21","author":"R. Sibson","year":"1977","unstructured":"Sibson, R. (1977). Locally equiangular triangulations. The Computer Journal, 21(3), 243\u2013245.","journal-title":"The Computer Journal"},{"issue":"11","key":"78_CR31","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1109\/71.969123","volume":"12","author":"I. Stojmenovic","year":"2001","unstructured":"Stojmenovic, I., & Lin, X. (2001). Power-aware localized routing in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 12(11), 1122\u20131133.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-007-0078-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-007-0078-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-007-0078-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T09:01:56Z","timestamp":1559379716000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-007-0078-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,13]]},"references-count":31,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["78"],"URL":"https:\/\/doi.org\/10.1007\/s11276-007-0078-x","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,13]]}}}