Encompassing colored planar straight line graphs. Computational Geometry, 39(1):14-23, 2008.Hurtado F., Kano M., Rappaport D., Tóth Cs.D.: Encompassing colored crossing-free geometric graphs. Comput. Geom. Theory Appl. 39 , 14–23 (2008)...
planar straight line graphgraph embeddingWe characterize the planar straight line graphs ( Pslg s) that can be augmented to 3-connected and 3-edge-connected Pslg s, respectively. We show that if a Pslg with n vertices can be augmented to a 3-edge-connected Pslg , then at most 2 n 2 ...
Tri-Edge-Connectivity Augmentation for Planar Straight Line Graphs Summary: It is shown that if a planar straight line graph (PSLG) with $n$ vertices in general position in the plane can be augmented to a 3-edge-connected ... M Al-Jubeh,M Ishaque,K Rédei,... - Springer-Verlag 被引...
We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation al- gorithm that circumvents the expensive search for the next split event. Our algorithm maint...
The problem of constructing such drawings has a long tradition when the drawings of both primal and dual are required to be straight-line. We consider the same problem for a planar graph and its rectangular dual. We show that the rectangular dual can be resized to host a planar straight-...
an algorithm for straight-line drawing of planar graphs 1 D Harel,M Sardas 被引量: 0发表: 2017年 On the Computational Complexity of Upward and Rectilinear Planarity Testing to approximate the minimum number of bends in a planar orthogonal drawing of an n-vertex graph with an O(n(1-epsilon...
Hybrid GA for straight-line drawings of level clustered planar graphs. Int J Comput Sci Issues (IJCSI) 2011;8(4):229-35, No. 2.Ahmed A. A. Radwan, Mohamed A. El-Sayed and Nahla F. Omran, "Hybrid GA for Straight-Line Drawings of Level Clustered Planar Graphs", IJCSI International ...
[1, 2] studied whether a bipartite planar graph has a drawing where the two sets of the partition can be separated by a straight line. Da Lozzo et al. [3] generalized the previous result and characterized the planar graphs with a partition L∪R∪S = V of the vertex set that have a...
We present a new algorithm to compute periodic (planar) straight-line drawings of toroidal graphs. Our algorithm is the first to achieve two important aesthetic criteria: the drawing fits in a straight rectangular frame, and the grid area is polynomial, precisely the grid size is O(n 4 脳 ...
We introduce ``doughnut graphs,'' a subclass of 5-connected planar graphs as well as 3-outerplanar graphs, which admits a straight-line grid drawing on a grid of area O(n). We introduce a subclass of 4-connected planar graphs that admits straight-line grid drawing with linear area. We...