Results 1 to 10 of about 745 (82)

Rock Mass Discontinuity Extraction Method Based on Multiresolution Supervoxel Segmentation of Point Cloud

IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2021
Discontinuity sets play an essential and pivotal role in the deformation monitoring and stability analysis of the rock mass, but there are still many challenges for accurately and rapidly extracting discontinuity.
Wenxiao Sun, Jian Wang, Yikun Yang, Fengxiang Jin   +3 more
doaj   +1 more source

Toward a Theory of Planarity: Hanani-Tutte and Planarity Variants

Journal of Graph Algorithms and Applications, 2013
We study Hanani-Tutte style theorems for various notions of planarity, including partially embedded planarity and simultaneous planarity. This approach brings together the combinatorial, computational and algebraic aspects of planarity notions and may ...
Marcus Schaefer
doaj   +1 more source

C-Planarity of C-Connected Clustered Graphs

Journal of Graph Algorithms and Applications, 2008
We present the first characterization of c-planarity for c-connected clustered graphs. The characterization is based on the interplay between the hierarchy of the clusters and the hierarchies of the triconnected and biconnected components of the ...
Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Maurizio Pizzonia   +4 more
doaj   +1 more source

Intersection-Link Representations of Graphs

Journal of Graph Algorithms and Applications, 2017
We consider drawings of graphs that contain dense subgraphs. We introduce intersection-link representations for such graphs, in which each vertex $u$ is represented by a geometric object $R(u)$ and each edge $(u,v)$ is represented by the intersection ...
Patrizio Angelini, Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter   +5 more
doaj   +1 more source

Efficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces

Journal of Graph Algorithms and Applications, 2009
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting?
Giuseppe Di Battista, Fabrizio Frati
doaj   +1 more source

Clustered Planarity: Small Clusters in Cycles and Eulerian Graphs

Journal of Graph Algorithms and Applications, 2009
We present several polynomial-time algorithms for c-planarity testing for cluster hierarchy C containing clusters of size at most three. The main result is an O(|C|3 + n)-time algorithm for clusters of size at most three on a cycle.
Eva Jelínková, Jan Kára, Jan Kratochvíl, Martin Pergel, Ondřej Suchý, Tomáš Vyskocil   +5 more
doaj   +1 more source

Clustering Cycles into Cycles of Clusters

Journal of Graph Algorithms and Applications, 2005
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level.
Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia   +3 more
doaj   +1 more source

Computing NodeTrix Representations of Clustered Graphs

Journal of Graph Algorithms and Applications, 2018
NodeTrix representations are a popular way to visualize clustered graphs; they represent clusters as adjacency matrices and inter-cluster edges as curves connecting the matrix boundaries.
Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani   +3 more
doaj   +1 more source

Planarity of Overlapping Clusterings Including Unions of Two Partitions

Journal of Graph Algorithms and Applications, 2017
We consider clustered planarity with overlapping clusters as introduced by Didimo et al. (Didimo, Giordano, Liotta, JGAA, 2008). It can be deduced from a proof in Athenstädt et al. (J. C. Athenstädt, T. Hartmann, and M.
Jan Christoph Athenstädt, Sabine Cornelsen   +1 more
doaj   +1 more source

Intact Planar Abstraction of Buildings via Global Normal Refinement from Noisy Oblique Photogrammetric Point Clouds

ISPRS International Journal of Geo-Information, 2018
Oblique photogrammetric point clouds are currently one of the major data sources for the three-dimensional level-of-detail reconstruction of buildings.
Qing Zhu, Feng Wang, Han Hu, Yulin Ding, Jiali Xie, Weixi Wang, Ruofei Zhong   +6 more
doaj   +1 more source