Results 21 to 30 of about 69,266 (252)
Simultaneous straight-line drawing of a planar graph and its rectangular dual
, 2015 A natural way to represent on the plane both a planar graph and its dual is to follow the definition of the dual, thus, to place vertices inside their corresponding primal faces, and to draw the dual edges so that they only cross their corresponding primal edges.
Tamara Mchedlidze
openalex +4 more sources
Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs
, 2014 Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings.
Mohamed A. El-Sayed +2 more
openalex +4 more sources
Planar Straight-line Realizations of 2-Trees with Prescribed Edge Lengths [PDF]
International Symposium Graph Drawing and Network Visualization, 2021 We study a classic problem introduced thirty years ago by Eades and Wormald. Let G = (V,E, λ) be a weighted planar graph, where λ : E → R is a length function.
Carlos Alegría-Galicia +5 more
semanticscholar +1 more source
Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs [PDF]
International Symposium Graph Drawing and Network Visualization, 2023 We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system places ...
Alvin Chiu, D. Eppstein, M. Goodrich
semanticscholar +1 more source
Electronic Journal of Qualitative Theory of Differential Equations, 2023 This paper deals with fundamental properties of Poincaré half-maps defined on a straight line for planar linear systems. Concretely, we focus on the analyticity of the Poincaré half-maps, their series expansions (Taylor and Newton–Puiseux) at the ...
Victoriano Carmona +3 more
doaj +1 more source
Drawing Planar Graphs with Few Geometric Primitives [PDF]
, 2017 We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw a path ...
A Igamberdiev +13 more
core +13 more sources
AN AUTOMATED METHOD FOR 3D ROOF OUTLINE GENERATION AND REGULARIZATION IN AIRBONE LASER SCANNER DATA [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2012 In this paper, an automatic approach for the generation and regularization of 3D roof boundaries in Airborne Laser scanner data is presented. The workflow is commenced by segmentation of the point clouds.
S. N. Perera, H. A. Nalani, H.-G. Maas
doaj +1 more source
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
Lower Bounds on the Area Requirements of Series-Parallel Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Graphs and ...
Fabrizio Frati
doaj +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