On the Volume and Resolution of 3-Dimensional Convex Graph Drawing (Extended Abstract)

by Marek Chrobak , Michael T. Goodrich , Roberto Tamassia

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	On the Volume and Resolution of 3-Dimensional Convex Graph Drawing (Extended Abstract)	user correction - Legacy Corrections
AUTHOR NAME	Marek Chrobak	SVM HeaderParse 0.1
AUTHOR NAME	Michael T. Goodrich	SVM HeaderParse 0.1
AUTHOR NAME	Roberto Tamassia	SVM HeaderParse 0.1
AUTHOR AFFIL	; z; Dept. of Computer Science Dept. of Computer Science Dept. of Computer Science; Univ. of California Johns Hopkins Univ. Brown Univ.; 3	SVM HeaderParse 0.2
AUTHOR ADDR	; Riverside, CA 92521 Baltimore, MD 21218 Providence, RI 02912	SVM HeaderParse 0.1
ABSTRACT	We address the problem of drawing a 3-connected planar graph as a convex polyhedron in R³. We give an efficient algorithm for producing such a realization using O(n) volume under the vertex-resolution rule. Each vertex in the drawing resulting from this method is guaranteed to need no more than O(n log n) bits to represent (as a pair of rational numbers). This solves an open problem of Cohen, Eades, Lin, and Ruskey. We also show that under the angularresolution rule drawing a 3-connected planar graph as a convex polyhedron in R³ requires at least exponential volume in the worst case.	user correction - Legacy Corrections
CITATIONS	39 found	ParsCit 1.0