Guest Editors’ Foreword
Discrete Comput Geom
Timothy M. Chan 0 1
Rolf Klein 0 1
0 R. Klein Institute of Computer Science I, University of Bonn , Bonn , Germany
1 T. M. Chan David R. Cheriton School of Computer Science, University of Waterloo , Waterloo, ON , Canada
This special issue of Discrete & Computational Geometry contains a selection of the best papers that were presented at the 29th Annual ACM Symposium on Computational Geometry, which was held in Rio de Janeiro, Brazil, on June 17-20, 2013. The six papers in this special issue were invited, submitted, reviewed, and revised according to the usual high standards of this journal. It is our pleasure to briefly introduce these contributions. Jeff Erickson solves a problem of long standing. A given topological mesh with convex quadrilateral faces on a closed surface can be extended to a hexahedral mesh of the interior domain (using Steiner points) if and only if the number of given quadrilaterals is even and if no odd cycle in the quadrilateral mesh bounds a surface in its interior. This generalizes previous results for topological spheres. If the given surface is polyhedral, the interior hexahedral mesh can be constructed in polynomial time, if it exists. The paper by Erin Chambers, Kyle Fox, and Amir Nayyeri presents a quadratic time algorithm for counting minimum cuts in weighted directed graphs that are embedded on orientable surfaces of constant genus. The improvement over a similar, recent result for planar graphs is obtained by counting cycles in a particular integer homology class. Gary Miller and Donald Sheehy introduce a novel output-sensitive algorithm for constructing Voronoi diagrams and Delaunay triangulations of n points in Euclidean space of constant dimension. It runs in time proportional to the output complexity times log n log , where denotes the spread of the input set. This algorithm avoids
computing convex hulls. Instead, it first adds n log many Steiner points to obtain a
well-spaced superset of sites whose Voronoi diagram is linear in size. Later, the extra
points are removed by controlled flipping.
Antoine Vigneron and Lie Yan present a faster algorithm for constructing
motorcycle graphs of n rays, whose running time is bounded by n4/3+. This improvement
is obtained by relaxing the chronological order of collisions. As a consequence, they
obtain more efficient algorithms for constructing the straight skeleton of polygons
with holes that are non-degenerate or have log n-bit rational numbers as coordinates.
In the latter case, the straight skeleton can be constructed in expected time n log3 n if
the number of holes is constant.
David Eppstein defines, by means of three-dimensional hyperbolic geometry, a new
type of power diagram which is invariant under Mbius transforms. It has surprising
applications. For a circle packing realizing the dual of a planar 3-vertex-connected,
3-regular graph G, this power diagram yields a Lombardi drawing of G, that is, a
planar embedding where edges are represented by circular arcs that meet at equal
angles. The existence of planar Lombardi drawings is generalized to 2-connected
graphs of maximum degree three. Another application concerns the characterization
of graphs formed by soap bubbles between two parallel sheets of glass. Exactly the
2-vertex-connected, 3-regular planar graphs occur.
Pankaj Agarwal, Sariel Har-Peled, Haim Kaplan, and Micha Sharir consider a
system of pairwise disjoint convex sets in the plane that are enlarged by forming
Minkowski sums with disks of random radii. While the union of the enlarged sets can
be of quadratic combinatorial complexity in the worst case, its expected complexity
is upper bounded by n1+ if radii are assigned to disks by a random permutation of a
given multiset. This result has applications to the vulnerability analysis of networks.
Acknowledgments We wish to thank all authors who contributed invited papers to this special issue.
Special thanks go to the reviewers who ensured the quality of the papers published with their anonymous
but much appreciated work. We are also grateful to the Editors-in-chief of DCG for giving us the opportunity
to prepare this special issue.