Results 21 to 30 of about 71,285 (269)
Encompassing colored planar straight line graphs
Computational Geometry, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ferrán Hurtado +3 more
openalex +2 more sources
Area-efficient planar straight-line drawings of outerplanar graphs
Discrete Applied Mathematics, 2007 An outerplanar graph \(G\) with \(n\) vertices and maximal degree \(d\) admits a planar straight-line grid drawing with area \(\mathbf O(dn^{1.48})\) in \(\mathbf O(n)\) time. In case \(d=\mathbf o(n^{0.52})\), \(G\) can be drawn this way in \(\mathbf o(n^2)\) area.
Ashim Garg, Adrian Rusu
openalex +3 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
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