Results 1 
4 of
4
Confluent drawings: Visualizing NonPlanar Diagrams in a Planar Way
 GRAPH DRAWING (PROC. GD ’03), VOLUME 2912 OF LECTURE NOTES COMPUT. SCI
, 2003
"... We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing nonplanar graphs in a planar way. This approach allows us to draw, in a crossingfree manner, graphs—such as software interaction diagrams—that would normally have many cro ..."
Abstract

Cited by 53 (9 self)
 Add to MetaCart
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing nonplanar graphs in a planar way. This approach allows us to draw, in a crossingfree manner, graphs—such as software interaction diagrams—that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged together and drawn as “tracks” (similar to train tracks). Producing such confluent drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed ones) to test if a nonplanar graph can be drawn efficiently in a confluent way. In addition, we identify several large classes of graphs that can be completely categorized as being either confluently drawable or confluently nondrawable.
Modeling Behaviors of Interactive Objects for Real Time Virtual Environments
 Journal of Visual Languages and Computing
"... Realtime 3D graphics are being extensively used to build interactive virtual environments for a number of different applications. In many situations, virtual objects are required to exhibit complex behaviors, and the use of a versatile behavioral programming methodology is required. This paper pres ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Realtime 3D graphics are being extensively used to build interactive virtual environments for a number of different applications. In many situations, virtual objects are required to exhibit complex behaviors, and the use of a versatile behavioral programming methodology is required. This paper presents a feature modeling approach to define behavioral information of virtual objects, giving special attention to their capabilities of interaction with virtual human actors. The proposed method is based on a complete definition and representation of interactive objects, which are called smart objects. This representation is based on the description of interaction features: parts, movements, graspable sites, functionalities, purposes, etc, including a behavioral automata based on scripts and graphical state machines.
Planar Graphs with Topological Constraints
 Journal of Graph Algorithms and Applications
, 2002
"... We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, userdefined topological constraints. The constraints consist each of a cycle... ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
(Show Context)
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, userdefined topological constraints. The constraints consist each of a cycle...
Graph Drawing Algorithm Engineering with AGD
, 2000
"... We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm. There is a common base class, also called the type of an algorithm, for algorithms providing basic ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm. There is a common base class, also called the type of an algorithm, for algorithms providing basically the same functionality. This enables us to exchange components and experiment with various algorithms and implementations of the same type. We give examples for algorithm engineering with AGD for drawing general nonhierarchical graphs and hierarchical graphs.