This paper presents the implementation and use of properties of symmetry groups in plane for graphic design with Java software. The project has both the pedagogical property of demonstrating the features of symmetry groups over the web, and it can be used as a useful generative tool for graphic designers and architects. The software enables the user to input drawing elements as generic objects,...

Currently, there are large collections of clip-art vector drawings from which users can select the desired figures to insert in their documents. However, to locate a particular drawing among thousands is not easy. Although there are some solutions for drawing retrieval, almost all of them are designed to retrieve simple and not complex drawings as for instance clip-arts. In our prior work we pr...

In this paper, traditional process design rules for deep drawing of box shapes are used to develop constraints within a dynamic programming (DP) approach to generate a set of alternative optimized process plans that minimize the number of drawing stages and heat treatments. The DP approach is capable of scanning a wide range of different alternative values for process parameters which allows fo...

A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing if there is no vertex in the relative interior of the axis parallel rectangle induced by the end points of each edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing. In a recent paper, w...

We consider the problem of drawing Venn diagrams for which each region’s area is proportional to some weight (e.g., population or percentage) assigned to that region. These area-proportional Venn diagrams have an enhanced ability over traditional Venn diagrams to visually convey information about data sets with interacting characteristics. We develop algorithms for drawing area-proportional Ven...

A drawing of a graph G in the plane is weakly simple if it can be turned into an embedding by an arbitrarily small perturbation. We show that testing, whether a straight-line drawing of a planar graph G in the plane is weakly simple, can be carried out in polynomial time, if a desired embedding of G belongs to a fixed isotopy class. In other words, we show that c-planarity with pipes is tractab...

Drawing is a simple, common, and expressive way to represent concepts and relationships for geographical databases. However, the possibility to revise the sketch and multiple interpretations of different shapes and their relationships in the sketch makes very difficult to determine the correct interpretation of the user goals. This paper starts from the assumption that the sketched picture is g...

Contour information is an important source for object perception and memory. Three experiments examined the precision of visual short-term memory for complex contour shapes. All used a new procedure that assessed recall memory for holistic information in complex contour shapes: Participants studied, then reproduced (without cues), a contoured shape by freehand drawing. In Experiment 1 memory pr...

We consider Quid vesicles of toroidal topology. Minimization of the curvature energy at fixed volume and area leads to three difterent branches of axisymmetric shapes. By using conformal transformations, we identify a large region of nonaxisymmetric shapes in the phase diagram. For vanishing spontaneous curvature, the ground state is twofold degenerate in this region and corresponds to zero pre...

A plane graph is a planar graph with a fixed embedding. In a no-bend orthogonal drawing of a plane graph, each vertex is drawn as a point and each edge is drawn as a single horizontal or vertical line segment. A planar graph is said to have a no-bend orthogonal drawing if at least one of its plane embeddings has a no-bend orthogonal drawing. In this paper we consider a class of planar graphs, c...