25 search results - page 3 / 5 » Universal Sets of n Points for 1-Bend Drawings of Planar Gra... |
DAM
2011
13 years 7 days ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...
COMGEO
2012
ACM
12 years 1 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
GD
1998
Springer
13 years 9 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...