Skip to Content
Handbook of Graph Drawing and Visualization
book

Handbook of Graph Drawing and Visualization

by Roberto Tamassia
August 2013
Intermediate to advanced content levelIntermediate to advanced
862 pages
32h 20m
English
Chapman and Hall/CRC
Content preview from Handbook of Graph Drawing and Visualization
130 CHAPTER 4. PROXIMITY DRAWINGS
that the number of edges of an n-vertex graph that has a relative neighborhood drawing
in 3-dimensional space is O(n
4/3
). Chazelle, Edelsbrunner, Guibas, Hershberger, Seid e l,
and Sharir [CEG
+
94] showed that the maximum number of edges of an n-vertex graph
that has a Gabriel drawing in d-dimensional space (d 3) is Ω(n
2
). I n [MS80], [Tou80],
and [Lan69], the p lanar ity of Gabriel drawable graphs, relative neighborhood graphs, and
relatively closest drawable graphs were shown, respectively. Furthermore, in [Cim92] it was
shown that a cycle with thr ee vertices is not relatively closest dr awable.
Particular atte ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Handbook of Graph Theory, 2nd Edition

Handbook of Graph Theory, 2nd Edition

Jonathan L. Gross, Jay Yellen, Ping Zhang
Drawing Product Ideas

Drawing Product Ideas

Kent E. Eisenhuth, Manuel Lima

Publisher Resources

ISBN: 9781420010268