메뉴 건너뛰기




Volumn , Issue , 2008, Pages 124-136

Efficient and accurate protocols for distributed delaunay triangulation under churn

Author keywords

[No Author keywords available]

Indexed keywords

DELAUNAY TRIANGULATION; DYNAMIC ENVIRONMENTS; NEIGHBOR DISCOVERY; PRO-ACTIVE APPROACH; PROTOCOL EFFICIENCY; REDUNDANT INFORMATIONS; SYSTEM STATE;

EID: 67249140976     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2008.4697031     Document Type: Conference Paper
Times cited : (22)

References (16)
  • 1
    • 4444219874 scopus 로고    scopus 로고
    • Online routing in triangulations
    • P. Bose and P. Morin, "Online routing in triangulations," SIAM Journal on Computing, vol.33, no. 4, pp. 937-951, 2004.
    • (2004) SIAM Journal on Computing , vol.33 , Issue.4 , pp. 937-951
    • Bose, P.1    Morin, P.2
  • 3
    • 0000670028 scopus 로고    scopus 로고
    • Incremental Topological Flipping Works for Regular Triangulations
    • H. Edelsbrunner, "Incremental topological flipping works for regular triangulations," Algorithmica, vol.15, no. 3, pp. 223-241, 1996. (Pubitemid 126418811)
    • (1996) Algorithmica (New York) , vol.15 , Issue.3 , pp. 223-241
    • Edelsbrunner, H.1    Shah, N.R.2
  • 6
    • 56349151015 scopus 로고    scopus 로고
    • Protocol design for dynamic delaunay triangulation
    • The Univ. of Texas at Austin, Dept. of Computer Sciences October 2006
    • D.-Y. Lee and S. S. Lam, "Protocol design for dynamic Delaunay triangulation," The Univ. of Texas at Austin, Dept. of Computer Sciences, Tech. Rep. TR-06-48, October 2006.
    • Tech. Rep. TR-06-48
    • Lee, D.-Y.1    Lam, S.S.2
  • 7
    • 67249130000 scopus 로고    scopus 로고
    • Efficient and accurate protocols for distributed delaunay triangulation under churn
    • The Univ. of Texas at Austin, Dept. of Computer Sciences November 2007, revised Sepetember 2008
    • -, "Efficient and Accurate Protocols for Distributed Delaunay Triangulation under Churn," The Univ. of Texas at Austin, Dept. of Computer Sciences, Tech. Rep. TR-07-59, November 2007, revised Sepetember 2008.
    • Tech. Rep. TR-07-59
  • 9
    • 0036800741 scopus 로고    scopus 로고
    • Application-layer multicasting with Delaunay triangulation overlays
    • DOI 10.1109/JSAC.2002.803067
    • J. N. Liebeherr, M. Nahas, and W. Si, "Application-layer multicasting with Delaunay triangulation overlays," IEEE Journal on Selected Areas in Communications, vol.20, no. 8, pp. 1472-1488, 2002. (Pubitemid 35220894)
    • (2002) IEEE Journal on Selected Areas in Communications , vol.20 , Issue.8 , pp. 1472-1488
    • Liebeherr, J.1    Nahas, M.2    Si, W.3
  • 10
    • 0036346553 scopus 로고    scopus 로고
    • Predicting internet network distance with coordinates-based approaches
    • New York City, New York, USA, June 2002
    • T. S. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proceedings of IEEE Infocom, New York City, New York, USA, June 2002.
    • Proceedings of IEEE Infocom
    • Ng, T.S.E.1    Zhang, H.2
  • 13
    • 34848861545 scopus 로고    scopus 로고
    • Distributed dynamic delaunay triangulation in d-dimensional spaces
    • August 2005
    • G. Simon, M. Steiner, and E. Biersack, "Distributed dynamic Delaunay triangulation in d-dimensional spaces," Institut Eurecom, Tech. Rep., August 2005.
    • Institut Eurecom, Tech. Rep.
    • Simon, G.1    Steiner, M.2    Biersack, E.3
  • 15
    • 84927514013 scopus 로고
    • Nouvelles applications des paramètres continus à la théorie des formes quadratiques
    • G. Voronöi, "Nouvelles applications des paramètres continus à la th́eorie des formes quadratiques," J. Reine Angew. Math, vol.134, pp. 198-287, 1908.
    • (1908) J. Reine Angew. Math , vol.134 , pp. 198-287
    • Voronöi, G.1
  • 16
    • 0019563697 scopus 로고
    • COMPUTING THE n-DIMENSIONAL DELAUNAY TESSELLATION WITH APPLICATION TO VORONOI POLYTOPES.
    • D. F. Watson, "Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes," The Computer Journal, vol.24, no. 2, pp. 167-172, 1981. (Pubitemid 12503887)
    • (1981) Computer Journal , vol.24 , Issue.2 , pp. 167-172
    • Watson, D.F.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.