#### Filter Results:

- Full text PDF available (44)

#### Publication Year

1998

2017

- This year (3)
- Last 5 years (32)
- Last 10 years (49)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Stephen G. Kobourov, Tamara Mchedlidze, Laura Vonessen
- Graph Drawing
- 2015

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)

- William S. Evans, Michael Kaufmann, William J. Lenhart, Tamara Mchedlidze, Stephen K. Wismath
- J. Graph Algorithms Appl.
- 2014

- Patrizio Angelini, Carla Binucci, +5 authors Yoshio Okamoto
- ISAAC
- 2012

A set S of k points in the plane is a universal point subset for a class G of planar graphs if every graph belonging to G admits a planar straight-line drawing such that k of its vertices are represented by the points of S. In this paper we study the following main problem: For a given class of graphs, what is the maximum k such that there exists a… (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)

- Patrizio Angelini, Walter Didimo, +4 authors Stephen K. Wismath
- Algorithmica
- 2011

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)

- Patrizio Angelini, Giuseppe Di Battista, Michael Kaufmann, Tamara Mchedlidze, Vincenzo Roselli, Claudio Squarcella
- Graph Drawing
- 2011

- Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis
- Graph Drawing
- 2010

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)

- Patrizio Angelini, David Eppstein, +5 authors Alexander Wolff
- CCCG
- 2013

We prove that there exists a set S of n points in the plane such that every n-vertex planar graph G admits a plane drawing in which every vertex of G is placed on a distinct point of S and every edge of G is drawn as a circular arc.

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)

- Tamara Mchedlidze, Antonios Symvonis
- WALCOM
- 2009

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)