6,681 research outputs found
Recommended from our members
Directed Placement for mVLSI Devices
Continuous-flow microfluidic devices based on integrated channel networks are becoming increasingly prevalent in research in the biological sciences. At present, these devices are physically laid out by hand by domain experts who understand both the underlying technology and the biological functions that will execute on fabricated devices. The lack of a design science that is specific to microfluidic technology creates a substantial barrier to entry. To address this concern, this article introduces Directed Placement, a physical design algorithm that leverages the natural "directedness" in most modern microfluidic designs: fluid enters at designated inputs, flows through a linear or tree-based network of channels and fluidic components, and exits the device at dedicated outputs. Directed placement creates physical layouts that share many principle similarities to those created by domain experts. Directed placement allows components to be placed closer to their neighbors compared to existing layout algorithms based on planar graph embedding or simulated annealing, leading to an average reduction in laid-out fluid channel length of 91% while improving area utilization by 8% on average. Directed placement is compatible with both passive and active microfluidic devices and is compatible with a variety of mainstream manufacturing technologies
Edge Label Placement in Layered Graph Drawing
Many visual languages based on node-link diagrams use edge labels. We describe different strategies of placing edge labels in the context of the layered approach to graph drawing and investigate ways of encoding edge direction in labels. We evaluate the label placement strategies based on both common aesthetic criteria and a controlled experiment. We find that placing labels on their edge can lead to more compact diagrams. Also, placing labels with additional arrows indicating edge direction can help users navigate in large diagrams and is generally preferred by participants of our experiment, outperforming other ways of indicating edge direction
Sugiyama Layouts for Prescribed Drawing Areas
The area of graph drawing is concerned with positioning the elements of a graph on a canvas such that the resulting drawing is well-readable by humans and aids their execution of certain tasks. While known methods are usually well-studied from a theoretical perspective, both their applicability to graphs from practice and their integration into tools from practice are not always satisfactory. This is due to various reasons, for instance, due to known methods usually solving well-defined, self-contained problems that do not cover all of the bits and pieces that must be considered in practice. There, the diagrams the graphs originate from often comprise more than just simple nodes and simple edges, they tend to be messy and complex, and existing methods regularly compute drawings with poor compactness. This thesis is concerned with improving the well-known layer-based layout approach, originally proposed by Sugiyama et al., and devotes special attention to the requirements of dataflow diagrams. It presents new methods for the approach's layer assignment and coordinate assignment steps, and it identifies and illustrates research tasks that are essential to further better the situation in practice
Wrapping layered graphs
We present additions to the widely-used layout method for directed acyclic graphs of Sugiyama et al. [16] that allow to better utilize a prescribed drawing area. The method itself partitions the graph's nodes into layers. When drawing from top to bottom, the number of layers directly impacts the height of a resulting drawing and is bound from below by the graph's longest path. As a consequence, the drawings of certain graphs are significantly taller than wide, making it hard to properly display them on a medium such as a computer screen without scaling the graph's elements down to illegibility. We address this with the Wrapping Layered Graphs Problem (WLGP), which seeks for cut indices that split a given layering into chunks that are drawn side-by-side with a preferably small number of edges wrapping backwards. Our experience and a quantitative evaluation indicate that the proposed wrapping allows an improved presentation of narrow graphs, which occur frequently in practice and of which the internal compiler representation SCG is one example
Text in Diagrams: Challenges to and Opportunities of Automatic Layout
Visual programming languages based on node-link diagrams are supposedly easy to use and to understand. This is only true, however, if the diagram elements are properly placed - a tedious and time-consuming process if done manually. Automatic graph layout algorithms alleviate users from that burden. Since even visual languages usually cannot make do without text, it follows that layout algorithms need to properly support textual labels. That is what this work is all about. We start by examining how enough space can be reserved for textual labels to be properly placed without overlaps. We then look at how users place comments in diagrams to establish relations to diagram elements. Our aim is to infer those, in order to take them into account during layout. We finally look at the negative implications of too much text: large diagrams and too much information. Different label management strategies dynamically change the text of labels, thus changing their size and, optionally, the amount of text displayed. All of the techniques are evaluated according to aesthetic criteria, and most are also validated through user studies
- …