Results 21 to 30 of about 20,159 (298)
Planar and Quasi-Planar Simultaneous Geometric Embedding [PDF]
The Computer Journal, 2014 A simultaneous geometric embedding SGE of two planar graphs G 1 and G 2 with the same vertex set is a pair of straight-line planar drawings Γ1 of G 1 and Γ2 of G 2 such that each vertex is drawn at the same point in Γ1 and Γ2. Many papers have been devoted to the study of which pairs of graphs admit a SGE, and both positive and negative results have ...
Emilio Di Giacomo +4 more
openaire +1 more source
Heliyon, 2023 Hypervelocity impact in the universe can be generated by a three-stage gas gun. Achieving the desirable planarity of the flyer enlarges the experimentally effective area of the flyer under the hypervelocity condition.
Chengcheng Guo +7 more
doaj +1 more source
Planar Depth and Planar Subalgebras
Journal of Functional Analysis, 2002 In [Planar algebras. I (preprint math.QA/9909027)] planar algebras were introduced by \textit{V. F. R. Jones} to get insight in the study of subfactors, especially in the algebraic-combinatorial aspects of the lattice of higher relative commutants. To each extremal type \(II_1\) finite index subfactor inclusion, Jones has associated a spherical \(C^*\)-
Landau, Zeph, Sunder, V.S
openaire +1 more source
Computing Planarity in Computable Planar Graphs
Graphs and Combinatorics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oscar Levin, Taylor McMillan
openaire +2 more sources
Journal of Algebraic Combinatorics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Starr, Colin L., Turner, Galen E. III
openaire +2 more sources
Recognizing IC-Planar and NIC-Planar Graphs
Journal of Graph Algorithms and Applications, 2018 We prove that triangulated IC-planar graphs and triangulated $K_5$-free or $X4W$-free NIC-planar graphs can be recognized in cubic time. A graph is 1-planar if it can be drawn in the plane with at most one crossing per edge. A drawing is IC-planar if, in addition, each vertex is incident to at most one crossing edge and NIC-planar if two pairs of ...
Christian Bachmaier +4 more
openaire +5 more sources
Inverse Neutrosophic Planar Graphs and its application in optimizing the expenditure in inter-cropping [PDF]
Neutrosophic Sets and SystemsThough Neutrosophic graphs have high impact on dealing with problems of indeterminacy, it may not directly address all aspects of edge membership degree constraints such as the truth membership degree of all edge is greater than or equal to the minimum ...
Thempaavai J.P, Antony Crispin Sweety C
doaj +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Textureless building surfaces composed of homogenized pixels could lead to failure of photometric consistency. However, textureless regions widely present in artificial scenes usually exhibit strong planarity enabling depth estimation of textureless ...
Nan Huang +7 more
doaj +1 more source
Clustered Planarity = Flat Clustered Planarity [PDF]
, 2018 The complexity of deciding whether a clustered graph admits a clustered planar drawing is a long-standing open problem in the graph drawing research area. Several research efforts focus on a restricted version of this problem where the hierarchy of the clusters is "flat", i.e., no cluster different from the root contains other clusters.
Pier Francesco Cortese +1 more
openaire +2 more sources
Noise modeling and depth calibration for Time-Of-Flight cameras
ELCVIA Electronic Letters on Computer Vision and Image Analysis, 2014 thesis extended ...
Amira Belhedi
doaj +1 more source