6 Result(s)
within
Algorithm Analysis and Problem Complexity
Stephane Durocher
Chapter
-
Chapter and Conference Paper
Embedding Plane 3-Trees in ℝ2 and ℝ3
A point-set embedding of a planar graph G with n vertices on a set P of n points in ℝ d , d ≥ 1, is a straight-line drawing of G, where the vertices of G are mapped to distinct p...
-
Chapter and Conference Paper
On Balanced -Contact Representations
In a -contact representation of a planar graph G, each vertex is represented as an axis-aligned plus shape consisting of two intersectin...
-
Chapter and Conference Paper
Trade-Offs in Planar Polyline Drawings
Angular resolution, area and the number of bends are some important aesthetic criteria of a polyline drawing. Although trade-offs among these criteria have been examined over the past decades, many of these tr...
-
Chapter and Conference Paper
Drawing Planar Graphs with Reduced Height
A straight-line (respectively, polyline) drawing Γ of a planar graph G on a set L k of k parallel lines is a planar drawing that maps each vertex of G to a dist...
-
Chapter and Conference Paper
Drawing Graphs Using Body Gestures
We introduce a new gesture-based user interface for drawing graphs that recognizes specific body gestures using the Microsoft Kinect sensor. Our preliminary user study demonstrates the potential for using gest...
-
Chapter and Conference Paper
Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
We wish to decide whether a simply connected flexible polygonal structure can be realized in Euclidean space. Two models are considered: polygonal linkages (body-and-joint framework) and contact graphs of unit...
