Tamara Mchedlidze

Learn More
Gestalt principles are rules for the organization of perceptual scenes. They were introduced in the context of philosophy and psychology in the 19th century and were used to define principles of human perception in the early 20th century. The Gestalt (form, in German) principles include, among others: proximity, the grouping of closely positioned objects;(More)
This paper studies the problem of computing an upward topological book embedding of an upward planar digraph G, i.e. a topological book embedding of G where all edges are monotonically increasing in the upward direction. Besides having its own inherent interest in the theory of upward book embeddability, the question has applications to well studied(More)
A drawing of a graph is a monotone drawing if for every pair of vertices u and v there is a path drawn from u to v that is monotone in some direction. In this paper we investigate planar monotone drawings in the fixed embedding setting, i.e., a planar embedding of the graph is given as part of the input that must be preserved by the drawing algorithm. In(More)
We study the problem of characterizing the directed graphs with an upward straightline embedding into every point set in general or in convex position. We solve two questions posed by Binucci et al. [Computational Geometry: Theory and Applications, 2010 ]. Namely, we prove that the classes of directed graphs with an upward straightline embedding into every(More)
Giordano, Liotta and Whitesides [1] developed an algorithm that, given an embedded planar st-digraph and a topological numbering ρ of its vertices, computes in O(n) time a ρ-constrained upward topological book embedding with at most 2n−4 spine crossings per edge. The number of spine crossings per edge is asymptotically worst case optimal. In this poster, we(More)
Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM) to be the problem of determining a hamiltonian path completion set of edges such that, when these edges are embedded on G, they create the smallest possible number of edge crossings and turn G to an acyclic(More)