{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:16:46Z","timestamp":1743099406526,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540273240"},{"type":"electronic","value":"9783540315841"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11516798_6","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T04:29:05Z","timestamp":1279081745000},"page":"81-93","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fast Localized Delaunay Triangulation"],"prefix":"10.1007","author":[{"given":"Filipe","family":"Ara\u00fajo","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Rodrigues","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,8,23]]},"reference":[{"issue":"2","key":"6_CR1","doi-asserted-by":"publisher","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.: On the randomized construction of the Delaunay tree. Theoretical Computer Science\u00a0112(2), 339\u2013354 (1993)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Bose, P., Morin, P.: Online routing in triangulations. In: 10th Annual Internation Symposium on Algorithms and Computation, ISAAC 1999 (1999)","DOI":"10.1007\/3-540-46632-0_12"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bose, P., Morin, P., Stojmenovi\u0107, I., Urrutia, J.: 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 (1999)","DOI":"10.1145\/313239.313282"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Fortune, S.: A sweepline algorithm for Voronoi diagrams. Algorithmica\u00a0(2), 153\u2013174 (1987)","DOI":"10.1007\/BF01840357"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K. Gabriel","year":"1969","unstructured":"Gabriel, K., Sokal, R.: A new statistichal approach to geographic variation analysis. Systematic Zoology\u00a018, 259\u2013278 (1969)","journal-title":"Systematic Zoology"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Gao, J., Guibas, L.J., Hershberger, J., Zhang, L., Zhu, A.: Geometric spanners for routing in mobile networks. In: 2nd ACM Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2001 (2001)","DOI":"10.1145\/501416.501424"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Karp, B., Kung, H.T.: GPRS: Greedy perimeter stateless routing for wireless networks. In: ACM\/IEEE International Conference on Mobile Computing and Networking (2000)","DOI":"10.1145\/345910.345953"},{"key":"6_CR8","unstructured":"Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: 11th Canadian Conference on Computation Geometry, CCCG 1999 (1999)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, DIALM 2002 (2002)","DOI":"10.1145\/570810.570814"},{"key":"6_CR10","unstructured":"Lan, L., Wen-Jing, H.: Localized Delaunay triangulation for topological construction and routing on manets. In: 2nd ACM Workshop on Principles of Mobile Computing, POMC 2002 (2002)"},{"issue":"3","key":"6_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00977785","volume":"9","author":"D.-T. Lee","year":"1980","unstructured":"Lee, D.-T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. International Journal of Computer and Information Sciences\u00a09(3), 219\u2013242 (1980)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"6_CR12","unstructured":"Li, X.-Y., Calinescu, G., Wan, P.-J.: 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 (2002)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","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.: Partial delaunay triangulation and degree limited localized bluetooth scatternet formation. IEEE Transactions on Parallel and Distributed Systems\u00a015(4), 350\u2013361 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"6_CR14","unstructured":"Liebeherr, J., Nahas, M., Si, W.: Application-layer multicasting with Delaunay triangulation overlays. Technical Report CS-2001-26, University of Virginia, Department of Computer Science, Charlottesville, VA 22904, 5 (2001)"},{"key":"6_CR15","first-page":"691","volume-title":"Data Link Protocols, ch. 16","author":"N. Lynch","year":"1996","unstructured":"Lynch, N.: Distributed algorithms. In: Data Link Protocols, ch. 16, pp. 691\u2013732. Morgan-Kaufmann, San Francisco (1996)"},{"key":"6_CR16","doi-asserted-by":"publisher","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.: Computational geometry: An introduction. Springer, Heidelberg (1985)"},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/comjnl\/21.3.243","volume":"21","author":"R. Sibson","year":"1977","unstructured":"Sibson, R.: Locally equiangular triangulations. The Computer Journal\u00a021(3), 243\u2013245 (1977)","journal-title":"The Computer Journal"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Stojmenovic, I.: Position-based routing in ad hoc networks. IEEE Communications Magazine (July 2002)","DOI":"10.1109\/MCOM.2002.1018018"},{"issue":"12","key":"6_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"4","author":"G. Toussaint","year":"1980","unstructured":"Toussaint, G.: The relative neighborhood graph of a finite planar set. Pattern Recognition\u00a04(12), 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"key":"6_CR20","unstructured":"Wang, Y., Li, X.-Y.: Geometric spanners for wireless ad hoc networks. In: The 22nd IEEE International Conference on Distributed Computing Systems (2002)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11516798_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T21:05:29Z","timestamp":1585688729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11516798_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540273240","9783540315841"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11516798_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"23 August 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}