Results 21 to 30 of about 3,062 (225)

Properties of Poincaré half-maps for planar linear systems and some direct applications to periodic orbits of piecewise systems

open access: yesElectronic 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

open access: yesMethodsX, 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

AN AUTOMATED METHOD FOR 3D ROOF OUTLINE GENERATION AND REGULARIZATION IN AIRBONE LASER SCANNER DATA [PDF]

open access: yesISPRS 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]

open access: yesDiscrete 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]

open access: yesDiscrete Mathematics & Theoretical Computer Science
The 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

On some properties of doughnut graphs

open access: yesAKCE 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

Straight line embeddings of cubic planar graphs with integer edge lengths [PDF]

open access: yesJournal of Graph Theory, 2008
AbstractWe prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc.
Geelen, Jim, Guo, Anjie, McKinnon, David
openaire   +2 more sources

Unbiased Finite Element Mesh Delaunay Constrained Triangulation Applied to 2D Images with High Morphological Complexity Using Mathematical Morphology Tools Part 2: Labeled Images

open access: yesComputation
We propose a method for generating a constrained Delaunay triangulation CDT applied to labeled 2D images with high morphological complexity. In the previous paper, Part 1, we established an unbiased planar straight-line graph (PLSG) on image objects of ...
F. N’Guyen, T. Kanit, A. Imad
doaj   +1 more source

Mechanochemical Synthesis and Characterization of Nanostructured ErB4 and NdB4 Rare‐Earth Tetraborides

open access: yesAdvanced Engineering Materials, Volume 27, Issue 6, March 2025.
ErB4 and NdB4 nanostructured powders are produced by mechanochemical synthesis. 5 h mechanical alloying and 4 M HCl acid leaching are used in the production. ErB4 and NdB4 powders exhibit maximum magnetization of 0.4726 emu g−1 accompanied with an antiferromagnetic‐to‐paramagnetic phase transition at about TN = 18 K and 0.132 emu g−1 with a maximum at ...
Burçak Boztemur   +5 more
wiley   +1 more source

Unbiased Finite Element Mesh Delaunay Constrained Triangulation Applied to 2D Images with High Morphological Complexity Using Mathematical Morphology Tools Part 1: Binary Images

open access: yesComputation
We propose a method for establishing a Constrained Delaunay Triangulation CDT applied to 2D binary images of high morphological complexity. A prerequisite for CDT is the unbiased definition of the Planar Straight-Line Graph PSLG, which must respect the ...
Franck N’Guyen   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy