Preserving the "mental map" is major goal of interactive graph drawing algorithms. Several models have been proposed for formalizing the notion of mental map. Additional work needs to be done to formulate and validate "difference" metrics which can be used in practice. This paper introduces a framework for defining and validating metrics to measure the difference between two drawings of the same graph.

Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms

We present two algorithms for orthogonal graph drawing in three dimensional space. For a graph with n vertices of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4:63n 3 and has at most three bends per edge. If the degree of the graph is arbitrary, the vertices are represented by solid 3-D boxes whose surface is proportional to their degree. The produced drawing has two bends per edge. Both algorithms guarantee no crossings and can be used under an interactive setting (i.e., vertices arrive and enter the drawing on-line), as well.

/pdf/algorithms-for-incremental-orthogonal-graph-drawing-in-three-2cc2f40kvu.pdf

Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions

The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of graphs. This paper builds on our previous work [3] by defining some additional similarity measures, refining some existing ones, and presenting the results of a user study designed to evaluate the suitability of the measures.

/pdf/a-user-study-in-similarity-measures-for-graph-drawing-1m9cyum5cf.pdf

A User Study in Similarity Measures for Graph Drawing

Most of the work that appears in the two-dimensional orthogonal graph drawing literature deals with graphs whose maximum degree is four. In this paper we present an algorithm for orthogonal drawings of simple graphs with degree higher than four. Vertices are represented by rectangular boxes of perimeter less than twice the degree of the vertex. Our algorithm is based on creating groups / pairs of vertices of the graph. The orthogonal drawings produced by our algorithm have area at most (m-1)\(\times\)( m / 2 +2) . Two important properties of our algorithm are that the drawings exhibit a small total number of bends (less than m ), and that there is at most one bend per edge.

Efficient Orthogonal Drawings of High Degree Graphs

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 algorithms in real‐life applications. In this paper, we describe the results of some of the most popular experimental studies on graph drawing algorithms. Each study presents an in‐depth comparative analysis on a specific class of algorithms, namely, algorithms for orthogonal drawings, interactive algorithms, algorithms for hierarchical drawings, and force‐directed and randomized algorithms. Copyright © 2000 John Wiley & Sons, Ltd.

/pdf/experimental-studies-on-graph-drawing-algorithms-10qbtb09du.pdf

Experimental studies on graph drawing algorithms

Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing of a graph. In this paper, we discuss features that are essential for an interactive orthogonal graph drawing system. We also describe some possible interactive drawing scenarios, present results on two of them, and compare their performance.

Interactive orthogonal graph drawing

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

A. Papakostas

Author Tools

Chat about Author

Papers

Interactive orthogonal graph drawing