am grateful to the participants for questions and remarks. I would also like to thank the anonymous referees for the Tbil-isi Symposium, and the participants of that symposium for their perceptive comments.

We present in this paper a new method for image description based on the description of encompassed regions. Image is firstly segmented in meaningful regions and in the next step these regions are represented semantically in a tree structure. Regions are described by means the geometry of their outline contours and the description of encompassed internal regions. An XML language XLWDI (XML Lang...

Paths drawn to a Music Map are used to quickly and intuitively create playlists by drawing figures onto the map surface. In this paper the correlation between the quality of a playlist and its visual shape on a Music Map is investigated. A series of amateur and professional playlists together with generated playlists are analysed according to their visualisation on a Music Map. Furthermore, the...

We describe in this paper a novel approach to the recognition of an object (an artifact) in a scene, in which the object appears in the foreground. We assume, in fact, that the camera has already focused on the object, drawing the attention to it on the basis of specific object features gathered from the initial scene. We emphasize the integration of preliminary perceptual processing with reaso...

We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-trees, and planar 3-trees. We prove that every 3-connected plane graph on n vertices has a plane drawing with at most 52n segments and at most 2n slopes. We prove that every cubic 3-connected plane graph has a plane dr...

Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph parameter thickness. By restricting the edges to be straight, we obtain the geometric thickness. By additionally restricting the vertices to be in convex position, we obtain the book thickness. This paper studies the ...

We present a method for constructing orthogonal drawings of graphs of maximum degree six in three dimensions. The method is based on generating the final drawing through a sequence of steps, starting from a “degenerate” drawing. At each step the drawing “splits” into two pieces and finds a structure more similar to its final version. Also, we test the effectiveness of our approach by performing...