17,557 research outputs found
Superpatterns and Universal Point Sets
An old open problem in graph drawing asks for the size of a universal point
set, a set of points that can be used as vertices for straight-line drawings of
all n-vertex planar graphs. We connect this problem to the theory of
permutation patterns, where another open problem concerns the size of
superpatterns, permutations that contain all patterns of a given size. We
generalize superpatterns to classes of permutations determined by forbidden
patterns, and we construct superpatterns of size n^2/4 + Theta(n) for the
213-avoiding permutations, half the size of known superpatterns for
unconstrained permutations. We use our superpatterns to construct universal
point sets of size n^2/4 - Theta(n), smaller than the previous bound by a 9/16
factor. We prove that every proper subclass of the 213-avoiding permutations
has superpatterns of size O(n log^O(1) n), which we use to prove that the
planar graphs of bounded pathwidth have near-linear universal point sets.Comment: GD 2013 special issue of JGA
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths
When can a plane graph with prescribed edge lengths and prescribed angles
(from among \}) be folded flat to lie in an
infinitesimally thin line, without crossings? This problem generalizes the
classic theory of single-vertex flat origami with prescribed mountain-valley
assignment, which corresponds to the case of a cycle graph. We characterize
such flat-foldable plane graphs by two obviously necessary but also sufficient
conditions, proving a conjecture made in 2001: the angles at each vertex should
sum to , and every face of the graph must itself be flat foldable.
This characterization leads to a linear-time algorithm for testing flat
foldability of plane graphs with prescribed edge lengths and angles, and a
polynomial-time algorithm for counting the number of distinct folded states.Comment: 21 pages, 10 figure
Structural Properties of Planar Graphs of Urban Street Patterns
Recent theoretical and empirical studies have focused on the structural
properties of complex relational networks in social, biological and
technological systems. Here we study the basic properties of twenty
1-square-mile samples of street patterns of different world cities. Samples are
represented by spatial (planar) graphs, i.e. valued graphs defined by metric
rather than topologic distance and where street intersections are turned into
nodes and streets into edges. We study the distribution of nodes in the
2-dimensional plane. We then evaluate the local properties of the graphs by
measuring the meshedness coefficient and counting short cycles (of three, four
and five edges), and the global properties by measuring global efficiency and
cost. As normalization graphs, we consider both minimal spanning trees (MST)
and greedy triangulations (GT) induced by the same spatial distribution of
nodes. The results indicate that most of the cities have evolved into networks
as efficienct as GT, although their cost is closer to the one of a tree. An
analysis based on relative efficiency and cost is able to characterize
different classes of cities.Comment: 7 pages, 3 figures, 3 table
The simplicity of planar networks
Shortest paths are not always simple. In planar networks, they can be very
different from those with the smallest number of turns - the simplest paths.
The statistical comparison of the lengths of the shortest and simplest paths
provides a non trivial and non local information about the spatial organization
of these graphs. We define the simplicity index as the average ratio of these
lengths and the simplicity profile characterizes the simplicity at different
scales. We measure these metrics on artificial (roads, highways, railways) and
natural networks (leaves, slime mould, insect wings) and show that there are
fundamental differences in the organization of urban and biological systems,
related to their function, navigation or distribution: straight lines are
organized hierarchically in biological cases, and have random lengths and
locations in urban systems. In the case of time evolving networks, the
simplicity is able to reveal important structural changes during their
evolution.Comment: 8 pages, 4 figure
Non-crossing frameworks with non-crossing reciprocals
We study non-crossing frameworks in the plane for which the classical
reciprocal on the dual graph is also non-crossing. We give a complete
description of the self-stresses on non-crossing frameworks whose reciprocals
are non-crossing, in terms of: the types of faces (only pseudo-triangles and
pseudo-quadrangles are allowed); the sign patterns in the self-stress; and a
geometric condition on the stress vectors at some of the vertices.
As in other recent papers where the interplay of non-crossingness and
rigidity of straight-line plane graphs is studied, pseudo-triangulations show
up as objects of special interest. For example, it is known that all planar
Laman circuits can be embedded as a pseudo-triangulation with one non-pointed
vertex. We show that if such an embedding is sufficiently generic, then the
reciprocal is non-crossing and again a pseudo-triangulation embedding of a
planar Laman circuit. For a singular (i.e., non-generic) pseudo-triangulation
embedding of a planar Laman circuit, the reciprocal is still non-crossing and a
pseudo-triangulation, but its underlying graph may not be a Laman circuit.
Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal
arise as the reciprocals of such, possibly singular, stresses on
pseudo-triangulation embeddings of Laman circuits.
All self-stresses on a planar graph correspond to liftings to piece-wise
linear surfaces in 3-space. We prove characteristic geometric properties of the
lifts of such non-crossing reciprocal pairs.Comment: 32 pages, 23 figure
- …