Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

DOI10.1137/S0895480103420744zbMath1068.05046OpenAlexW3099590791MaRDI QIDQ4652618

Hsueh-I Lu, I-fan Sun, Ching-Chi Lin

Publication date: 28 February 2005

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480103420744

zbMATH Keywords

graph drawingcanonical orderingplanar graph algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory to circuits and networks (94C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (14)

Visibility representations of four-connected plane graphs with near optimal heights ⋮ Special graph representation and visualization of semantic networks ⋮ Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs ⋮ Bijections for Baxter families and related objects ⋮ Compact visibility representation of 4-connected plane graphs ⋮ Orthogonal surfaces and their CP-orders ⋮ Width-Optimal Visibility Representations of Plane Graphs ⋮ Schnyder woods and orthogonal surfaces ⋮ Visibility drawings of plane 3-trees with minimum area ⋮ Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights ⋮ Optimal \(st\)-orientations for plane triangulations ⋮ Algorithms for Drawing Planar p-petal Graphs ⋮ AN APPLICATION OF WELL-ORDERLY TREES IN GRAPH DRAWING ⋮ Visibility representation of plane graphs via canonical ordering tree

This page was built for publication: Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer