Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
14
Effective information visualisation: a study of graph Drawing Aesthetics . . .
, 2000
"... Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms which render an abstract graph structure as a diagram are valued for their conformance to aesthetic criteria (e.g. reducin ..."
Abstract
-
Cited by 28 (2 self)
- Add to MetaCart
Information visualisation systems which generate diagrams representing discrete relational information must consider potential users if they are to be effective. Many algorithms which render an abstract graph structure as a diagram are valued for their conformance to aesthetic criteria (e
Effective information visualisation: a study of graph
, 2000
"... Information visualisation systems which generate diagrams representing discrete relational infor-mation must consider potential users if they are to be effective. Many algorithms which render an abstract graph structure as a diagram are valued for their conformance to aesthetic criteria (e.g. reduci ..."
Abstract
- Add to MetaCart
Information visualisation systems which generate diagrams representing discrete relational infor-mation must consider potential users if they are to be effective. Many algorithms which render an abstract graph structure as a diagram are valued for their conformance to aesthetic criteria (e
Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study
, 2001
"... Many existing automatic graph layout algorithms are unrelated to any particular semantic domain. Designers of such algorithms tend to conform to layout aesthetics, and claim that by doing so, the resultant diagram is easy to understand. Few algorithms are designed for a specific domain, and there is ..."
Abstract
-
Cited by 23 (0 self)
- Add to MetaCart
, and there is no guarantee that the aesthetics used for generic layout algorithms will be useful for the visualisation of domain-specific diagrams (for example, visual programs, or entity-relationship diagrams). This paper describes a study which aimed to identify the most important aesthetics for the automatic layout
FORCE‐DIRECTED GRAPH DRAWING AND AESTHETICS MEASUREMENT IN A NON‐STRICT PURE FUNCTIONAL PROGRAMMING LANGUAGE
, 2009
"... Non‐strict pure functional programming often requires redesigning algorithms and data structures to work more effectively under new constraints of non‐strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in the non‐strict pure functi ..."
Abstract
- Add to MetaCart
Non‐strict pure functional programming often requires redesigning algorithms and data structures to work more effectively under new constraints of non‐strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in
Application of computational media aesthetics methodology to extracting color semantics
- in film”, ACM Multimedia, Juan Les Pins
, 2002
"... Using film grammar as the underpinning, we study the ex-traction of structures in video based on color using a wide configuration of clustering methods combined with existing and new similarity measures. We study the visualisation of these structures, which we call Scene-Cluster Temporal Charts and ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
Using film grammar as the underpinning, we study the ex-traction of structures in video based on color using a wide configuration of clustering methods combined with existing and new similarity measures. We study the visualisation of these structures, which we call Scene-Cluster Temporal Charts
A comparison of User-Generated and automatic graph layouts
- IEEE Transactions on Visualization and Computer Graphics
"... Abstract—The research presented in this paper compares user-generated and automatic graph layouts. Following the methods suggested by van Ham et al. (2008), a group of users generated graph layouts using both multi-touch interaction on a tabletop display and mouse interaction on a desktop computer. ..."
Abstract
-
Cited by 19 (4 self)
- Add to MetaCart
. Users were asked to optimize their layout for aesthetics and analytical tasks with a social network. We discuss characteristics of the user-generated layouts and interaction methods employed by users in this process. We then report on a web-based study to compare these layouts with the output of popular
Break the "right" cycles and get the "best" drawing
- Proc. of the 2nd International Workshop on Algorithm Engineering and Experiments (ALENEX'00
, 2000
"... We consider the two-layer crossing minimization problem (CP): given a two-layered graph and a permutation of the vertices on a layer, find a permutation of the vertices on the other layer so that the number of edge crossings is minimum. Solving CP represents a fundamental step in the construction of ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
strategy. Our experimental results show that algorithm PM stands out as a practical and effective method for minimizing crossings in bipartite drawings. 1. INTRODUCTION Directed graphs are well suitable for representing any kind of structured information. Hence, producing aesthetically pleasing layouts
Planar Preprocessing for Spring Embedders
"... Abstract. Spring embedders are conceptually simple and produce straight-line drawings with an undeniable aesthetic appeal, which explains their prevalence when it comes to automated graph drawing. However, when drawing planar graphs, spring embedders often produce non-plane drawings, as edge crossin ..."
Abstract
- Add to MetaCart
crossings do not factor into the objective function being minimized. On the other hand, there are fairly straight-forward algorithms for creating plane straight-line drawings for planar graphs, but the resulting layouts generally are not aesthetically pleasing, as vertices are often grouped in small regions
Visualization methods for sharing knowledge pieces and relationships based on biological models
"... Abstract. We study visualization methods for sharing knowledge pieces and relationships. Our purpose is to grasp informational structures readily. We develop algorithms based on a flocking model which simulates birds or fishes behavior in making a group. We implement two visualization systems for ae ..."
Abstract
- Add to MetaCart
Abstract. We study visualization methods for sharing knowledge pieces and relationships. Our purpose is to grasp informational structures readily. We develop algorithms based on a flocking model which simulates birds or fishes behavior in making a group. We implement two visualization systems
Results 1 - 10
of
14
