Results 1  10
of
342
Workflow Management: Models, Methods, and Systems
, 2002
"... Copyright © 2000 W. M. P. van der Aalst/K. M. van Hee No part of this publication may be reproduced in any form, by print, photoprint, microfilm, audio tape, electronic or any other means, nor stored in a retrieval system, without the prior written permission of the publisher. Prof.dr.ir. W.M.P. van ..."
Abstract

Cited by 184 (7 self)
 Add to MetaCart
Copyright © 2000 W. M. P. van der Aalst/K. M. van Hee No part of this publication may be reproduced in any form, by print, photoprint, microfilm, audio tape, electronic or any other means, nor stored in a retrieval system, without the prior written permission of the publisher. Prof.dr.ir. W.M.P. van der Aalst
Sustainable Interaction Design
 Invention & Disposal, Renewal & Reuse. In Proc.of CHI ‘07
, 2007
"... This paper considers the concept of ensoulment in relation to the design principle of promoting quality & equality within Sustainable Interaction Design (SID). The designtheoretic origins and implications are discussed and the background needed to understand this concept and principle are state ..."
Abstract

Cited by 31 (6 self)
 Add to MetaCart
This paper considers the concept of ensoulment in relation to the design principle of promoting quality & equality within Sustainable Interaction Design (SID). The designtheoretic origins and implications are discussed and the background needed to understand this concept and principle are stated. Appropriate design research methods are discussed. Parts of a completed survey are described and initial findings from an ongoing elicitation study for collecting personal inventories is also presented. The implications of the survey and elicitation study for larger scale design research are described, with an eye towards future research. 1.
Flow Map Layout via Spiral Trees
"... Abstract—Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. Good flow maps reduce visua ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
Abstract—Flow maps are thematic maps that visualize the movement of objects, such as people or goods, between geographic regions. One or more sources are connected to several targets by lines whose thickness corresponds to the amount of flow between a source and a target. Good flow maps reduce visual clutter by merging (bundling) lines smoothly and by avoiding selfintersections. Most flow maps are still drawn by hand and only few automated methods exist. Some of the known algorithms do not support edgebundling and those that do, cannot guarantee crossingfree flows. We present a new algorithmic method that uses edgebundling and computes crossingfree flows of high visual quality. Our method is based on socalled spiral trees, a novel type of Steiner tree which uses logarithmic spirals. Spiral trees naturally induce a clustering on the targets and smoothly bundle lines. Our flows can also avoid obstacles, such as map features, region outlines, or even the targets. We demonstrate our approach with extensive experiments. Index Terms—Flow maps, Automated Cartography, Spiral Trees. 1
On the Most Likely Convex Hull of Uncertain Points
"... Abstract. Consider a set of ddimensional points where the existence or the location of each point is determined by a probability distribution. The convex hull of this set is a random variable distributed over exponentially many choices. We are interested in finding the most likely convex hull, nam ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
Abstract. Consider a set of ddimensional points where the existence or the location of each point is determined by a probability distribution. The convex hull of this set is a random variable distributed over exponentially many choices. We are interested in finding the most likely convex hull, namely, the one with the maximum probability of occurrence. We investigate this problem under two natural models of uncertainty: the point (also called the tuple) model where each point (site) has a fixed position si but only exists with some probability pii, for 0 < pii ≤ 1, and the multipoint model where each point has multiple possible locations or it may not appear at all. We show that the most likely hull under the point model can be computed in O(n3) time for n points in d = 2 dimensions, but it is NP–hard for d ≥ 3 dimensions. On the other hand, we show that the problem is NP–hard under the multipoint model even for d = 2 dimensions. We also present hardness results for approximating the probability of the most likely hull. While we focus on the most likely hull for concreteness, our results hold for other natural definitions of a probabilistic hull. 1
Geometric simultaneous embeddings of a graph and a matching
 Journal of Graph Algorithms and Applications
"... The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is plane. Geometric simultaneous embedding is a current topic in graph drawing and positive and negative results are known for ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is plane. Geometric simultaneous embedding is a current topic in graph drawing and positive and negative results are known for various classes of graphs. So far only connected graphs have been considered. In this paper we present the first results for the setting where one of the graphs is a matching. In particular, we show that there exists a planar graph and a matching which do not admit a geometric simultaneous embedding. This generalizes the same result for a planar graph and a path. On the positive side, we describe algorithms that compute a geometric simultaneous embedding of a matching and a wheel, outerpath, or tree. Our drawing algorithms minimize the number of orientations used to draw the edges of the matching. Specifically, when embedding a matching and a tree, we can draw all matching edges horizontally. When embedding a matching and a wheel or an outerpath, we use only two orientations. 1
AREAUNIVERSAL AND CONSTRAINED RECTANGULAR LAYOUTS ∗
"... Abstract. A rectangular layout is a partition of a rectangle into a finite set of interiordisjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangl ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. A rectangular layout is a partition of a rectangle into a finite set of interiordisjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignments. A layout is areauniversal if any assignment of areas to rectangles can be realized by a combinatorially equivalent rectangular layout. We identify a simple necessary and sufficient condition for a rectangular layout to be areauniversal: a rectangular layout is areauniversal if and only if it is onesided. We also investigate similar questions for perimeter assignments. The adjacency requirements for the rectangles of a rectangular layout can be specified in various ways, most commonly via the dual graph of the layout. We show how to find an areauniversal layout for a given set of adjacency requirements whenever such a layout exists. Furthermore we show how to impose restrictions on the orientations of edges and junctions of the rectangular layout. Such an orientationconstrained layout, if it exists, may be constructed in polynomial time, and all orientationconstrained layouts may be listed in polynomial time per layout.
On Planar Supports for Hypergraphs
"... A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [9] proved that it is NPcomplete to decide ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar. Johnson and Pollak [9] proved that it is NPcomplete to decide if a given hypergraph has a planar support. In contrast, there are polynomial time algorithms to test whether a given hypergraph has a planar support that is a path, cycle, or tree. In this paper we present an algorithm which tests in polynomial time if a given hypergraph has a planar support that is a tree where the maximal degree of each vertex is bounded. Our algorithm is constructive and computes a support if it exists. Furthermore, we prove that it is already NPhard to decide if a hypergraph has a 2outerplanar support.
Combinatorial and Geometric Properties of Planar Laman Graphs
"... Abstract. Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar barandjoint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer physics. We introduce three new combinatorial struct ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Abstract. Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar barandjoint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer physics. We introduce three new combinatorial structures for planar Laman graphs: angular structures, angle labelings, and edge labelings. The latter two structures are related to Schnyder realizers for maximally planar graphs. We prove that planar Laman graphs are exactly the class of graphs that have an angular structure that is a tree, called angular tree, and that every angular tree has a corresponding angle labeling and edge labeling. Using a combination of these powerful combinatorial structures, we show that every planar Laman graph has an Lcontact representation, that is, planar Laman graphs are contact graphs of axisaligned Lshapes. Moreover, we show that planar Laman graphs and their subgraphs are the only graphs that can be represented this way. We present efficient algorithms that compute, for every planar Laman graph G, an angular tree, angle labeling, edge labeling, and finally an Lcontact representation of G. The overall running time is O(n 2), where n is the number of vertices of G, and the Lcontact representation is realized on the n × n grid.
1 Executive Summary
"... This report documents the program and the outcomes of Dagstuhl Seminar 11191 “Graph Drawing with Algorithm Engineering Methods”. We summarize the talks, open problems, and working group discussions. ..."
Abstract
 Add to MetaCart
This report documents the program and the outcomes of Dagstuhl Seminar 11191 “Graph Drawing with Algorithm Engineering Methods”. We summarize the talks, open problems, and working group discussions.
Results 1  10
of
342