Results 1 to 10 of about 65,390 (252)
Straight-line Drawability of a Planar Graph Plus an Edge
, 2015 We investigate straight-line drawings of topological graphs that consist of a planar graph plus one edge, also called almost-planar graphs. We present a characterization of such graphs that admit a straight-line drawing.
Peter Eades +4 more
core +5 more sources
GA for straight-line grid drawings of maximal planar graphs
Egyptian Informatics Journal, 2012 A straight-line grid drawing of a planar graph G of n vertices is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segment without edge crossings.
Mohamed A. El-Sayed
doaj +2 more sources
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
Geological surface reconstruction from 3D point clouds
MethodsX, 2021 The numerical simulation of phenomena such as subsurface fluid flow or rock deformations are based on geological models, where volumes are typically defined through stratigraphic surfaces and faults, which constitute the geometric constraints, and then ...
Cristina Serazio +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
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
From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms.
Giuseppe Di Battista, 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
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