Results 31 to 40 of about 71,285 (269)
On rigid origami I: piecewise-planar paper with straight-line creases [PDF]
Proceedings of the Royal Society A, 2018 Origami (paper folding) is an effective tool for transforming two-dimensional materials into three-dimensional structures, and has been widely applied to robots, deployable structures, metamaterials, etc.
Zeyuan He, S. Guest
semanticscholar +1 more source
Morphing Planar Graph Drawings Optimally [PDF]
, 2014 We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound.
C. Erten +10 more
core +1 more source
On some properties of doughnut graphs
AKCE International Journal of Graphs and Combinatorics, 2016 The class of doughnut graphs is a subclass of 5-connected planar graphs. It is known that a doughnut graph admits a straight-line grid drawing with linear area, the outerplanarity of a doughnut graph is 3, and a doughnut graph is k-partitionable. In this
Md. Rezaul Karim +2 more
doaj +1 more source
Drawing Planar Graphs with a Prescribed Inner Face [PDF]
, 2013 Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan +7 more
core +2 more sources
Stabbing line segments with disks: complexity and approximation algorithms [PDF]
, 2017 Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of
Kobylkin, Konstantin
core +1 more source
Strongly Monotone Drawings of Planar Graphs [PDF]
, 2016 A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the ...
Felsner, Stefan +5 more
core +2 more sources
On Universal Point Sets for Planar Graphs [PDF]
, 2013 A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15.
Cardinal, Jean +2 more
core +2 more sources
Recognizing and Drawing IC-planar Graphs
, 2015 IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer +27 more
core +1 more source
Convex drawings of hierarchical planar graphs and clustered planar graphs [PDF]
, 1906 In this paper, we present results on convex drawings of hierarchical graphs and clustered graphs. A convex drawing is a planar straight-line drawing of a plane graph, where every facial cycle is drawn as a convex polygon.
Hong, Seok-Hee, Nagamochi, Hiroshi
core +1 more source
How to Morph Planar Graph Drawings [PDF]
SIAM journal on computing (Print), 2016 Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves straight-line ...
Soroush Alamdari +12 more
semanticscholar +1 more source