A
Antonios Symvonis
Researcher at National Technical University of Athens
Publications - 136
Citations - 1571
Antonios Symvonis is an academic researcher from National Technical University of Athens. The author has contributed to research in topics: Planar graph & Graph drawing. The author has an hindex of 22, co-authored 132 publications receiving 1479 citations. Previous affiliations of Antonios Symvonis include Dartmouth College & Karlsruhe Institute of Technology.
Papers
More filters
Journal ArticleDOI
Boundary labeling: Models and efficient algorithms for rectangular maps
TL;DR: In this paper, the authors introduce boundary labeling, a new model for labeling point sites with large labels, where labels are placed around an axis-parallel rectangle that contains the point sites, each label is connected to its corresponding site through a polygonal line called leader, and no two leaders intersect.
Journal ArticleDOI
Drawing graphs in the plane with high resolution
Michael Formann,T. Hagerup,J. Haralambides,Michael Kaufmann,Frank Thomson Leighton,Antonios Symvonis,Emo Welzl,Gerhard J. Woeginger +7 more
TL;DR: In this paper, the problem of drawing a graph in the plane so that edges appear as straight lines and the minimum angle formed by any pair of incident edges is maximized is presented.
Journal ArticleDOI
The Straight-Line RAC Drawing Problem is NP-Hard
TL;DR: In this paper, it was shown that it is NP-hard to decide whether a graph admits a straight-line RAC drawing, where every pair of crossing edges intersects at right angle.
Book ChapterDOI
Boundary labeling: models and efficient algorithms for rectangular maps
TL;DR: In this paper, the authors present boundary labeling, a new approach for labeling point sets with large labels, where disjoint labels are placed around an axis-parallel rectangle that contains the points, such that no two connections intersect.
Journal ArticleDOI
Three-dimensional orthogonal graph drawing algorithms
TL;DR: Algorithms are used to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6, and initiate the study of bend/bounding box trade-off issues for three- dimensional grid drawings.