Graph layout algorithms typically conform to one or more aesthetic criteria (e.g. minimising the number of bends, maximising orthogonality). Determining the extent to which a grap...
This paper presents an efficient extraction method of closed loops as primitive symbols of line drawings, and an robust line drawing understanding system incorporating this extrac...
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...