✦ LIBER ✦

Performance evaluation of graph drawing algorithms

✍ Scribed by Koji Sumi; Hisatoshi Tanaka; Hiroyuki Ebara; Hideo Nakano

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 857 KB
Volume: 80
Category: Article
ISSN: 1042-0967
DOI: 10.1002/(sici)1520-6440(199706)80:6<54::aid-ecjc6>3.0.co;2-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Experimental studies on graph drawing al

Experimental studies on graph drawing algorithms

✍ Luca Vismara; Giuseppe Di Battista; Ashim Garg; Giuseppe Liotta; Roberto Tamassi 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 1023 KB

Graph drawing plays an important role in the solution of many information visualization problems. Most of the graph drawing algorithms are accompanied by a theoretical analysis of their characteristics, but only extensive experimentations can assess the practical performance of graph drawing algorit

An algorithm for drawing planar graphs

✍ Bor Plestenjak 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

Performance Evaluation of Document Struc

Performance Evaluation of Document Structure Extraction Algorithms

✍ Jisheng Liang; Ihsin T Phillips; Robert M Haralick 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 114 KB

This paper presents a performance metric for the document structure extraction algorithms by finding the correspondences between detected entities and ground truth. We describe a method for determining an algorithm's optimal tuning parameters. We evaluate a group of document layout analysis algorith

Rectilinear drawings of graphs

✍ Carsten Thomassen 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 314 KB

We consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden subconfigurations, which of these graphs are equivalent to drawings such that all edges are straight line segments. As a consequence we obtain a complete characteriza

Monotone drawings of planar graphs

✍ János Pach; Géza Tóth 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__‐monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__‐coordinates of the vertices remain unchanged and the edges become non‐cross

A Simple Linear Time Algorithm for Prope

A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs

✍ Xin He 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper Ž . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr