A binary tanglegram is a drawing of a pair of rooted binary trees whose leaf sets are in one-toone correspondence; matching leaves are connected by inter-tree edges. For applications, for example, in phylogenetics, it is essential that both trees are drawn without edge crossings and that the inter-tree edges have as few crossings as possible. It is known that finding a tanglegram with the minim...

BACKGROUND Since psychological tests such as questionnaire or drawing tests are almost qualitative, their results carry a degree of uncertainty and sometimes subjectivity. The deficiency of all drawing tests is that the assessment is carried out after drawing the objects and lots of information such as pen angle, speed, curvature and pressure are missed through the test. In other words, the psy...

In this paper, we study a new problem of finding a convex drawing of graphs with a non-convex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an inner-convex drawing, can be obtained in linear time.

This paper describes a radial layout method for displaying B +-tree data structures. We present an algorithmic framework for computing the node positions that result in a planar drawing. Layout issues related to displaying the internal structure of the nodes are addressed. Each field value and associated pointer that comprises the internal structure of the node is considered a subnode. The draw...

The effectiveness of mental imagery with and without drawing support (perceptual assistance) in the visual synthesis of novel patterns was studied in three experiments. When the task was to create one recognizable pattern from three simple shapes in a 2-min assembly period, subjects were as likely to produce a recognizable or creative pattern per trial whether mental imagery was augmented by ex...

This paper describes an extension of SVG that supports the drawing of graphs in terms of nodes and edges in between nodes. The graph drawing primitives support a variety of different node shapes, edge connection points, and edges. Both nodes and edges can be labeled. Two or more nodes can be aggregated as a single node, and an entire graph can be embedded into a single node. In addition, a numb...

This paper presents DrawCompileEvolve, a web-based drawing tool which allows users to draw simple primitive shapes, group them together or define patterns in their groupings (e.g. symmetry, repetition). The user’s vector drawing is then compiled into an indirectly encoded genetic representation, which can be evolved interactively, allowing the user to change the image’s colors, patterns and ult...

A fundamental problem in editing shapes is the recognition of partial shapes in a drawing to which changes are to be made. In this paper the possibility of using shape rules as a mechanism for effecting such changes is explored. Shape rules represent spatial relationships between two shapes a and /? with the interpretation that any instance of a in a shape can be replaced by a 'similar' instanc...

Deep drawing process is one of the widely used methods in sheet-metal forming. With the deep drawing method, products of various geometrical shapes such as saucepans, tubes, perfume and soft drink cans can be obtained easily. Therefore, the optimization of the deep drawing process is very important for the industry. In conventional deep drawing method, no angle is given to the surfaces of die a...

We show that the shape of a complex cubic field lies on geodesic modular surface defined by field's trace-zero form. also prove general such statement for all orders in \'etale Q-algebras. Applying method Manjul Bhargava and Piper H to results Ariel Shnidman, we shapes lying fixed become equidistributed with respect hyperbolic measure as discriminant goes infinity. is complete invariant (within...