Simplified kinetic connectivity for rectangles and hypercubes

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 158-167

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b University of California   (United States)

Author keywords

Algorithms; Design; Theory; Verification

Indexed keywords

EID: 64049109309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Lakshmi Ramachandran, Manika Kapoor, Abhinanda Sarkar, Alok .Aggarwal, Clustering algorithms forwireless ad hoc networks, Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, p.54-63, August 11-11, 2000, Boston, Massachusetts, United States [doi>10.1145/345848.345860]
2. A. D. Amis, R. Prakash, T. H. P. Vuong, and D. T. Huynh. Max-min d-cluster formation in wireless ad hoc networks. In Proc. of IEEE INFOCOM, 2000.
3. B. Aronov, H. Edelsbrunner, Leonidas J. Guibas, and Micha Sharir. The number of edges of many faces in a line segment arrangement. Combinatorica, 12(3) :261- 274, 1992.
4. Julien Basch, Leonidas J. Guibas, Data structures for mobile data, Journal of Algorithms, v.31 n.1, p.1-28, April 1999, [doi> 10.1006/jagm.1998.0988]
5. http://www.bluetooth.com/.
6. Mark de Berg, Matthew Katz, A. Frank van der Stappen, Jules Vleugels, Realistic input models for geometric algorithms, Proceedings of the thirteenth annual symposium on Computational geometry, p.294-303, June 04-06, 1997, Nice, France [doi>10.1145/262839.262986]
7. Herbert Edelsbrunner, Algorithms in combinatorial geometry, Springer-Verlag New York, Inc., New York, NY, 1987
8. Leonidas Guibas, John Hershberger, Subhash Sur, Li Zhang, Kinetic connectivity for unit disks, Proceedings of the sixteenth annual symposium on Computational geometry, p.331-340, June 12-14, 2000, Clear Water Bay, Kowloon, Hong Kong. [doi>10.1145/336154.336220]
9. John Hershberger, Subhash Suri, Kinetic connectivity of rectangles, Proceedings of the fifteenth annual symposium on Computational geometry, p.237-246, June 13-16, 1999, Miami Beach, Florida, United States [doi>10.1145/304893.304977]
10. Jacob Holm , Kristian de Lichtenberg, Mikkel Thorup, Poly-logarithmic deterministic fullydynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.79-89. May 24-26, 1998, Dallas, Texas, United States [doi>10.1145/276698.276715]
11. H. Imai and Ta. Asano. Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane, d. Algorithms, 4:310-323, 1983.
12. D. B. Johnson. Routing in ad hoc networks of mobile hosts. In Proc. IEEE Workshop on Mobile Computing Systems and Applications, 1994.
13. Robert Endre Tarjan, Data structures andnetwork algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983
14. C-K. Toh. A novel distributed routing protocol to support ad-hoc mobile computing. In Proc. 15th IEEE Ann. Internat. Phoenix Conf. on Computers and Comm., pages 480-486, 1996.