Results 1  10
of
442
Straightline drawing of quadrangulations
 In Proceedings of Graph Drawing’06
, 2006
"... Abstract. This article introduces a straightline drawing algorithm for quadrangulations, in the family of the facecounting algorithms. It outputs in linear time a drawing on a regular W ×H grid such that W +H = n − 1 − ∆, where n is the number of vertices and ∆ is an explicit combinatorial paramet ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. This article introduces a straightline drawing algorithm for quadrangulations, in the family of the facecounting algorithms. It outputs in linear time a drawing on a regular W ×H grid such that W +H = n − 1 − ∆, where n is the number of vertices and ∆ is an explicit combinatorial
Orthogonal Straight Line Drawing of Trees
, 1999
"... This paper is written for the purpose of describing my ScM Project. It introduces a drawing algorithm for a tree type of graph. The drawing algorithm is the extension of the orthogonal straight line drawing [1], which is implemented in java and the javadoc documentation is attached in the appendix. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper is written for the purpose of describing my ScM Project. It introduces a drawing algorithm for a tree type of graph. The drawing algorithm is the extension of the orthogonal straight line drawing [1], which is implemented in java and the javadoc documentation is attached in the appendix
Orthogonal Straight Line Drawing of Trees
, 1999
"... This paper is written for the purpose of describing my ScM Project. It introduces a drawing algorithm for a tree type of graph. The drawing algorithm is the extension of the orthogonal straight line drawing[1], which is implemented in java and the javadoc documentation is attached in the appendix. W ..."
Abstract
 Add to MetaCart
This paper is written for the purpose of describing my ScM Project. It introduces a drawing algorithm for a tree type of graph. The drawing algorithm is the extension of the orthogonal straight line drawing[1], which is implemented in java and the javadoc documentation is attached in the appendix
StraightLine Drawings of Graphs in Three Dimensions
"... This is an overview of results and open problems pertaining to straightline drawings of graphs in integer grids, in particular when drawn in three dimensions. As presented at: Journees de Geometrie Algorithmique 2002. ..."
Abstract
 Add to MetaCart
This is an overview of results and open problems pertaining to straightline drawings of graphs in integer grids, in particular when drawn in three dimensions. As presented at: Journees de Geometrie Algorithmique 2002.
On collinear sets in straight line drawings
 IN PROC. 37TH WORKSHOP ON GRAPHTHEORETIC CONCEPTS IN COMP. SCI. (TEPLÁ
, 2008
"... Given a planar graph G on n vertices, let fix(G) denote the maximum k such that any straight line drawing of G with possible edge crossings can be made crossingfree by moving at most n − k vertices to new positions. Let ¯v(G) denote the maximum possible number of collinear vertices in a crossingfre ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Given a planar graph G on n vertices, let fix(G) denote the maximum k such that any straight line drawing of G with possible edge crossings can be made crossingfree by moving at most n − k vertices to new positions. Let ¯v(G) denote the maximum possible number of collinear vertices in a
Straightline Drawings of 1planar Graphs
"... Abstract. The classical Fáry’s theorem from the 1930s states that every planar graph can be drawn as a straightline drawing. In this paper, we extend Fáry’s theorem to nonplanar graphs. More specifically, we study the problem of drawing 1planar graphs with straightline edges. A 1planar graph is ..."
Abstract
 Add to MetaCart
Abstract. The classical Fáry’s theorem from the 1930s states that every planar graph can be drawn as a straightline drawing. In this paper, we extend Fáry’s theorem to nonplanar graphs. More specifically, we study the problem of drawing 1planar graphs with straightline edges. A 1planar graph
Transversal structures on triangulations, with application to straight line drawing
 LECTURE NOTES IN COMPUTER SCIENCE
, 2005
"... We define and study a structure called transversal edgepartition related to triangulations without non empty triangles, which is equivalent to the regular edge labeling discovered by Kant and He. We study other properties of this structure and show that it gives rise to a new straightline drawing ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
We define and study a structure called transversal edgepartition related to triangulations without non empty triangles, which is equivalent to the regular edge labeling discovered by Kant and He. We study other properties of this structure and show that it gives rise to a new straightline drawing
An Algorithm for StraightLine Drawing of Planar Graphs
, 1998
"... We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generalization of the algorithm of Chrobak and Payne, which, in turn, is based on an algorithm by de Fraysseix, Pach, and Pollack. Our algorithm improves the previous ones in that it does not require a prelimi ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We present a new algorithm for drawing planar graphs on the plane. It can be viewed as a generalization of the algorithm of Chrobak and Payne, which, in turn, is based on an algorithm by de Fraysseix, Pach, and Pollack. Our algorithm improves the previous ones in that it does not require a
Results 1  10
of
442