See this document in CiteSeerX!

Traversal of a Quasi-Planar Subdivision without Using Mark Bits (Extended Abstract) (2004)  (Make Corrections)  (1 citation)
E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, J. Urrutia



  Home/Search   Context   Related

 
View or download:
scs.carleton.ca/~kranaki...WMAN042.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  scs.carleton.ca/~kranaki...papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: E. Chvez Escuela de Ciencias Fsico-Matemticas Universidad Michoacana, Mxico S. Dobrev # School of IT and Engineering University of Ottawa, Canada E. Kranakis + School of Computer Science Carleton University, Canada J. Opatrn # Department of Computer Science Concordia University, Canada L. Stacho Department of Mathematics Simon Fraser University, Canada J. Urrutia Instituto de Matemticas Universidad Nacional Autnoma de Mxico Mxico Abstract The problem of traversal of planar... (Update)

Cited by:   More
Route Discovery with Constant Memory in Oriented.. - Chavez, Dobrev.. (2004)   (Correct)

Active bibliography (related documents):   More   All
0.5:   A Compendium of Problems Complete for Symmetric Logarithmic.. - Alvarez, Greenlaw (1996)   (Correct)
0.4:   Aligned Virtual Coordinates for Greedy Geometric Routing .. - Ke Liu, Nael..   (Correct)
0.3:   Online Routing in Geometric Graphs - Morin (2001)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text:   More   All
0.2:   Digital Three-Dimensional Object Reconstruction and.. - Frauel, Javidi   (Correct)
0.2:   Simple Traversal of a Subdivision Without Extra Storage - de Berg, van Oostrum.. (1997)   (Correct)
0.2:   Area Functionals in Plane Grid Generation - Tinoco-Ruiz..   (Correct)

BibTeX entry:   (Update)

E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, and J. Urrutia. Traversal of a quasi-planar subdivision without using mark bits. accepted for 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN'04), Fanta Fe, New Mexico, 2004. http://citeseer.ist.psu.edu/chavez04traversal.html   More

@misc{ chavez04traversal,
  author = "E. Chavez and S. Dobrev and E. Kranakis and J. Opatrny and L. Stacho and
    J. Urrutia",
  title = "Traversal of a quasi-planar subdivision without using mark bits",
  text = "E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, and J. Urrutia.
    Traversal of a quasi-planar subdivision without using mark bits. accepted
    for 4th International Workshop on Algorithms for Wireless, Mobile, Ad Hoc
    and Sensor Networks (WMAN'04), Fanta Fe, New Mexico, 2004.",
  year = "2004",
  url = "citeseer.ist.psu.edu/chavez04traversal.html" }
Citations (may not include all citations):
1254   Computational geometry: an introduction (context) - Preparata, Shamos - 1985
315   Routing with guaranteed delivery in ad hoc wireless networks - Bose, Morin et al. - 2001  ACM   DBLP
75   Compass routing on geometric networks - Kranakis, Singh et al. - 1999  DBLP
74   A pivoting algorithm for convex hulls and vertex enumeration.. (context) - Avis, Fukuda - 1991  ACM   DBLP
65   universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
40   Finding the intersection of two convex polyhedra (context) - Muller, Preparata - 1978  DBLP
27   Geometric ad-hoc routing: Of theory and practice - Kuhn, Wattenhofe et al. - 2003  DBLP
24   Worst-case optimal and average-case efficient geometric ad-h.. - Kuhn, Wattenhofe et al. - 2003  ACM   DBLP
13   Automated contour mapping using triangular element data stru.. (context) - Gold, Maydell et al. - 1977  ACM
10   A time-space tradeoff for undirected graph traversal by walk.. - Beame, Borodin et al. - 1999  ACM   DBLP
8   An improved algorithm for subdivision traversal without extr.. - Bose, Morin - 2002  ACM   DBLP
6   connectivity in undirected graphs (context) - Armoni, Ta-Shma et al.
6   Technical description of the dime system (context) - Peuquet, Marble - 1990
6   Simple traversal of a subdivision without extra storage (context) - de Berg, van Kreveld et al. - 1997  ACM   DBLP
4   RL SC (context) - Nisan - 1994
3   Arcinfo example contemporary geographic information system (context) - Marble, an et al. - 1990
2   connectivity in polynomial time and sublinear space (context) - Barnes, Ruzzo - 1996
2   Traversal of geometric planar networks using a mobile agent .. (context) - Czyczowicz, Kranakis et al.
1   Undirecter connectivity in o (context) - Nisan, Szemeredi et al. - 1992

Documents on the same site (http://www.scs.carleton.ca/~kranakis/papers.html):   More
Improving Customer Proximity to Railway Stations - Kranakis, Penna, Schlude..   (Correct)
Distributed Computing On Anonymous Hypercubes With Faulty.. - Kranakis, Santoro (1992)   (Correct)
The eXtended Satellite Transport Protocol: Its Design.. - Elaasar, Li, Barbeau, .. (2003)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC