On the efficiency of a local iterative algorithm to compute delaunay realizations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 69-86

  Lillis, Kevin M ^a,b   Pemmaraju, Sriram V ^a  

^a University of Iowa   (United States)

^b ST AMBROSE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; EVOLUTIONARY ALGORITHMS; ITERATIVE METHODS; METROPOLITAN AREA NETWORKS; NETWORK PROTOCOLS; ROUTING ALGORITHMS; SENSOR NETWORKS; SENSORS; WIRELESS SENSOR NETWORKS;

DELAUNAY; EXPERIMENTAL ALGORITHMS; GENERAL (CO); GREEDY ROUTING; INTERNATIONAL (CO); ITERATIVE ALGORITHMS; LOW DIMENSIONAL SPACE (LDS); MESSAGE DELIVERY; WIRELESS SENSOR NETWORKS (WSNS);

ROUTING PROTOCOLS;

EID: 45449093968     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_6     Document Type: Conference Paper

References (18)

1. Andreev, E.M.: On convex polyhedra in Lobacevskii space. Math. USSR Sbornik 10(3), 413-440 (1970)
2. Andreev, E.M.: On convex polyhedra of finite volume in Lobachevskii space. Math. USSR Sbornik 12(2), 255-259 (1970)
3. Ben-Chen, M., Gotsman, C., Gortler, S.: Routing with guaranteed delivery on virtual coordinates. In: Proceedings of the 18th Canadian Conference on Computational Geometry (CCCG 2006), pp. 117-120 (2006)
4. Ben-Chen, M., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: Proceedings of the 23rd annual symposium on Computational geometry (SoCG 2007), pp. 210-219. ACM Press, New York, NY, USA (2007)
5. Bose, P., Morin, P.: Online routing in triangulations. In: Aggarwal, A.K., Pandu Rangan, C. (eds.) ISAAC 1999. LNCS, vol. 1741, pp. 113-122. Springer, Heidelberg (1999)
6. Collins, C.R., Stephenson, K.: A circle packing algorithm. Computational Geometry: Theory and Applications 25(3), 233-256 (2003)
7. Dhandapani, R.: Greedy drawings of triangulations. In: Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms (SODA 2008), SIAM, Philadelphia (2008)
8. Edelsbrunner, H., Shah, N.R.: Incremental topological flipping works for regular triangulations. In: Proceedings of the eighth annual symposium on Computational geometry (SoCG 1992), pp. 43-52. ACM, New York, NY, USA (1992)
9. Hiroshima, T., Miyamoto, Y., Sugihara, K.: Another proof of polynomial-time recognizability of Delaunay graphs. In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (IEICE 2000), April 2000, vol. 83(4), pp. 627-638 (2000)
10. Karp, B., Kung, H.T.: GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2000), pp. 243-254 (2000)
11. Knaster, B., Kuratowski, C., Mazurkiewicz, S.: Ein beweis des fixpunktsatzes für n-dimensionale simplexe. Fundamenta Mathematicae 14, 132-137 (1929)
12. Koebe, P.: Kontatkprobleme der konformen abbildung. Berichte über die Verhand-lungen d. Sächs. Akademie der Wissenschaften Leipzia 88, 141-164 (1936)
13. Mohar, B.: A polynomial time circle packing algorithm. Discrete Mathematics 117(1-3), 257-263 (1993)
14. Pach, J., Agarwal, P.K.: Combinatorial Geometry. John Wiles & Sons, New York, NY, USA (1995)
15. Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science 344(1), 3-14 (2005)
16. Santi, P.: Topology control in wireless ad hoc and sensor networks. ACM Computing Surveys 37(2), 164-194 (2005)
17. Smith, W.D.: Accurate circle configurations and numerical conformal mapping in polynomial time. NEC Research Institute, unpublished technical memorandum (December 1991)
18. Thurston, W.P.: The geometry and topology of 3-manifolds. Princeton University Notes, Princeton (1988)