Distributed computation of virtual coordinates

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 210-219

  Chen, Mirela Ben ^a   Gotsman, Craig ^a   Wormser, Camille ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b INRIA   (France)

Author keywords

Distributed computing; Greedy routing; Planar embedding; Power diagrams; Virtual coordinates

Indexed keywords

GREEDY ROUTING; PLANAR EMBEDDING; POWER DIAGRAMS; VIRTUAL COORDINATES;

COMPUTATION THEORY; GRAPH THEORY; ROUTING PROTOCOLS; SENSOR NETWORKS; VIRTUAL REALITY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 35348849047     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247108     Document Type: Conference Paper

References (20)

1. BOBENKO, A., AND SPRINGBORN, B. Variational principles for circle patterns and koebe's theorem. Trans. Amer. Math. Soc. 356 (2004), 659-689.
2. BOSE, P., MORIN, P., STOJMENOVIC, I., AND URRUTIA, J. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7, 6 (2001), 609-616.
3. CHEN, M. B., GOTSMAN, C., AND GORTLER, S. J. Routing with guaranteed delivery on virtual coordinates. In Proc. Canadian Conf. on Comp. Geom. (2006).
4. COLIN DE VERDIÈRE, Y. Empilements de cercles: Convergence d'une méthode de point fixe. In Forum Mathematicum (1989), vol. 1, pp. 395-402.
5. COLLINS, C., AND STEPHENSON, K. A circle packing algorithm. Computational Geometry: Theory and Applications 25 (2003), 233-256.
6. DILLENCOURT, M. B., AND SMITH, W. D. Graph-theoretical conditions for inscribability and delaunay realizability. Discrete Mathematics 161 (1996), 63-77.
7. FUNKE, S., AND MILOSAVLJEVIC, N. Network sketching or: "how much geometry hides in connectivity? - part ii". In Proc. ACM-SIAM Symp. on Discrete Algorithms (2007).
8. FUSY, E. Quadratic exact-size and linear approximate-size random sampling of planar graphs. In Proc. Analysis of Algorithms (2005).
9. HIROSHIMA, T., MIYAMOTO, Y., AND SUGIHARA, K. Another proof of polynomial-time recognizability of delaunay graphs. IEICE Trans. Fund. 83, 4 (2000), 627-638.
10. HODGSON, C. D., RIVIN, I., AND SMITH, W. D. A characterization of convex hyperbolic polyhedra, and of convex polyhedra inscribed in the sphere. Bull, of the Amer. Math. Soc. 27, 3 (1992).
11. KHAREVYCH, L., SCHROEDER, P., AND SPRINGBORN, B. Discrete conformal mappings via circle patterns. A CM Transactions on Graphics (2006).
12. KLEINBERG, R. Geographic routing using hyperbolic space. In Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). (2007).
13. KRANAKIS, E., SINGH, H., AND URRUTIA, J. Compass routing on geometric networks. In Proc. Canadian Conf. on Comp. Geom. (1999), pp. 51-54.
14. MORIN, P. Online Routing in Geometric Graphs. PhD thesis, Computer Science, Carleton University, 2001.
15. PAPADIMITRIOU, C., AND RATAJCZAK, D. On a conjecture related to geometric routing. In Proc. ALGOSENSORS (2004), pp. 9-17.
16. RAO, A., PAPADIMITRIOU, C., SHENKER, S., AND STOICA, I. Geographic routing without location information. In Proc. MobiCom (2003).
17. SHEFFER, A., LÉVY, B., MOGILNITSKY, M., AND BOGOMYAKOV, A. Abf++ : Fast and robust angle based flattening. ACM Transactions on Graphics 24, 2 (2005), 311-300.
18. STEPHENSON, K. Introduction to Circle Packing. The Theory of Discrete Analytic Functions. Cambridge University Press, April 2005.
19. THURSTON, W. The Geometry and Topology of 3-Manifolds. Princeton University Notes, Preprint.
20. THURSTON, W. The finite riemann mapping theorem. In Invited talk, An International Symposium at Purdue University on the occasion of the proof of the Bieberbach conjecture (March 1999).