Results 1 
8 of
8
Transversal structures on triangulations, combinatorial study and straightline drawing
, 2007
"... This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, called irreducible triangulations. The structure has been introduced by Xin He under the name of regular edgelabelling and consists of two transversal bip ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, called irreducible triangulations. The structure has been introduced by Xin He under the name of regular edgelabelling and consists of two transversal bipolar orientations. For this reason, the terminology used here is that of transversal structures. The main results obtained in the article are a bijection between irreducible triangulations and ternary trees, and a straightline drawing algorithm for irreducible triangulations. For a random irreducible triangulation with n vertices, the grid size of the drawing is asymptotically with high probability 11n/27 × 11n/27 up to an additive error of O ( √ n). In contrast, the best previously known algorithm for these triangulations only guarantees a grid size (⌈n/2 ⌉ − 1) × ⌊n/2⌋.
Planar Drawings of Plane Graphs
, 2000
"... this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results. ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
this paper first we review known two methods to find such drawings, then explain a hidden relation between them, and finally survey related results.
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 12 (5 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 algorithm for triangulations without non empty triangles, and more generally for 4connected plane graphs with at least 4 border vertices. Taking uniformly at random such a triangulation with 4 border vertices and n vertices, the size of the grid is almost surely n
Convex drawings of graphs with nonconvex boundary
 Proc. of WG 2006
, 2006
"... Abstract. In this paper, we study a new problem of finding a convex drawing of graphs with a nonconvex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a starshaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
Abstract. In this paper, we study a new problem of finding a convex drawing of graphs with a nonconvex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a starshaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an innerconvex drawing, can be obtained in linear time. 1
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 5 (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 parameter of the quadrangulation. 1
RectangleofInfluence Drawings of FourConnected Plane Graphs (Extended Abstract)
, 2005
"... A rectangleofinfluence drawing of a plane graph G is no vertex in the proper inside of the axisparallel rectangle defined by the two ends of any edge. In this paper, weshow that any 4connected plane graph G rectangleofinfluence drawing in an integer grid such that W + H n, where n is the numb ..."
Abstract
 Add to MetaCart
A rectangleofinfluence drawing of a plane graph G is no vertex in the proper inside of the axisparallel rectangle defined by the two ends of any edge. In this paper, weshow that any 4connected plane graph G rectangleofinfluence drawing in an integer grid such that W + H n, where n is the numberofvertices in G, W is the width and H is the height of the grid. Thus the area W \ThetaH of the grid is at most d(n;1)=2e\Delta b(n;1)=2c. Our bounds on the grid sizes are optimal in a sense that there exist an infinite number of 4connected plane graphs whose drawings need grids such that W +H = n;1andW \Theta H = d(n ; 1)=2e\Delta b(n ; 1)=2c. We also showthatthe drawing can be found in linear time.
Hubert de FRAYSSEIX..................
, 2010
"... pour obtenir le grade de Docteur de l ’ École Polytechnique ..."