MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Achilleas Papakostas" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 7 documents found, showing 1 through 7.
ATOM RSS
  • A Pairing Technique for Area-Efficient Orthogonal Drawings (Extended Abstract)  
  • by A. Papakostas, I. Tollis, Achilleas Papakostas, Ioannis G. Tollis — in Proc. of Symp. for Graph Drawing
  • …An orthogonal drawing of a graph is a drawing such that vertices are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, the…
  • Cited by 3 (1 self) – Add To MetaCart
  • Interactive Orthogonal Graph Drawing  
  • by Achilleas Papakostas, Ioannis G. Tollis — 1996 — Proc. of GD '95
  • …Many applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing allows the user to dynamically interact with the drawing. In this paper we discuss features that are essential for an interacti…
  • Cited by 4 (1 self) – Add To MetaCart
  • Issues in Interactive Orthogonal Graph Drawing  
  • by Achilleas Papakostas, Ioannis G. Tollis — 1995
  • …. Several applications require human interaction during the design process. The user is given the ability to alter the graph as the design progresses. Interactive Graph Drawing gives the user the ability to dynamically interact with the drawing. In this paper we discuss features that are essential f…
  • Cited by 4 (1 self) – Add To MetaCart
  • Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends  
  • by Achilleas Papakostas, Ioannis G. Tollis — 1996 — Proc. Algorithms and Data Structures: 5th International Workshop (WADS'97), volume 1272 of Lecture Notes in Cornput. Sci
  • …Most of the work that appears in the orthogonal graph drawing literature deals with graphs whose maximum degree is four. In this paper we present an algorithm for orthogonal drawings of simple graphs with degree higher than four. Vertices are represented by rectangular boxes of perimeter less than t…
  • Cited by 5 (0 self) – Add To MetaCart
  • Algorithms for Area-Efficient Orthogonal Drawings  
  • by Achilleas Papakostas, Ioannis G. Tollis — 1996 — Computational Geometry: Theory and Applications
  • …An orthogonal drawing of a graph is a drawing such that nodes are placed on grid points and edges are drawn as sequences of vertical and horizontal segments. In this paper we present linear time algorithms that produce orthogonal drawings of graphs with n nodes. If the maximum degree is four, then t…
  • Cited by 11 (3 self) – Add To MetaCart
  • Incremental Orthogonal Graph Drawing in Three Dimensions  
  • by Achilleas Papakostas, Ioannis G. Tollis — 1997 — J. Graph Algorithms Appl
  • …We present two algorithms for orthogonal graph drawing in three dimensional space. For graphs of maximum degree six, the 3-D drawing is produced in linear time, has volume at most 4:66n 3 and allows for at most three bends per edge. If the degree of the graph is arbitrary, the vertices are represe…
  • Cited by 14 (0 self) – Add To MetaCart
  • Experimental and Theoretical Results in Interactive Orthogonal Graph Drawing  
  • by Achilleas Papakostas, Janet M. Six, Ioannis G. Tollis — Proc. of Symposium for Graph Drawing
  • …. Interactive Graph Drawing allows the user to dynamically interact with a drawing as the design progresses while preserving the user's mental map. This paper presents a theoretical analysis of RelativeCoordinates and an extensive experimental study comparing the performance of two interactive ortho…
  • Cited by 2 (0 self) – Add To MetaCart
Help! Showing 1 through 7.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB