2013
DOI: 10.1016/j.adhoc.2013.05.013
|View full text |Cite
|
Sign up to set email alerts
|

Void traversal for efficient non-planar geometric routing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2014
2014

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 34 publications
0
1
0
Order By: Relevance
“…The authors in [6] come close to actually formulate the link embedding principle. In an effort to adapt planar routing methods to non-planar graphs, they consider the line segments corresponding to all the communication links, and then they construct the virtual planar graph where crossings are represented by virtual nodes.…”
Section: Related Workmentioning
confidence: 99%
“…The authors in [6] come close to actually formulate the link embedding principle. In an effort to adapt planar routing methods to non-planar graphs, they consider the line segments corresponding to all the communication links, and then they construct the virtual planar graph where crossings are represented by virtual nodes.…”
Section: Related Workmentioning
confidence: 99%