Results 31 to 40 of about 69,266 (252)

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, Md. Jawaherul Alam, Md. Saidur Rahman   +2 more
doaj   +1 more source

Drawing Planar Graphs with a Prescribed Inner Face [PDF]

, 2013
Given a plane graph $G$ (i.e., a planar graph with a fixed planar embedding) and a simple cycle $C$ in $G$ whose vertices are mapped to a convex polygon, we consider the question whether this drawing can be extended to a planar straight-line drawing of ...
C.A. Duncan, D. Avis, E.W. Chambers, J. Pach, M. Patrignani, S.-H. Hong, V. Jelínek, W.T. Tutte   +7 more
core   +2 more sources

Stabbing line segments with disks: complexity and approximation algorithms [PDF]

, 2017
Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of
Kobylkin, Konstantin
core   +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, Marco Tamburini, Francesca Verga, Stefano Berrone   +3 more
doaj  

Strongly Monotone Drawings of Planar Graphs [PDF]

, 2016
A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is given by the ...
Felsner, Stefan, Igamberdiev, Alexander, Kindermann, Philipp, Klemz, Boris, Mchedlidze, Tamara, Scheucher, Manfred   +5 more
core   +2 more sources

Convex drawings of hierarchical planar graphs and clustered planar graphs [PDF]

, 1906
In this paper, we present results on convex drawings of hierarchical graphs and clustered graphs. A convex drawing is a planar straight-line drawing of a plane graph, where every facial cycle is drawn as a convex polygon.
Hong, Seok-Hee, Nagamochi, Hiroshi
core   +1 more source

Recognizing and Drawing IC-planar Graphs

, 2015
IC-planar graphs are those graphs that admit a drawing where no two crossed edges share an end-vertex and each edge is crossed at most once. They are a proper subfamily of the 1-planar graphs.
C Auer, C Auer, C Binucci, C Thomassen, D Král, E Ackerman, E Giacomo Di, E Giacomo Di, E Giacomo Di, EN Argyriou, FJ Brandenburg, H Fraysseix de, J Fox, J Pach, M Chrobak, MA Bekos, MJ Alam, MR Garey, O Cheong, OV Borodin, P Eades, S Hong, S-H Hong, VP Korzhik, W Didimo, W Didimo, X Zhang, X Zhang   +27 more
core   +1 more source

On Universal Point Sets for Planar Graphs [PDF]

, 2013
A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no n-universal point set of size n, for any n>=15.
Cardinal, Jean, Hoffmann, Michael, Kusters, Vincent   +2 more
core   +2 more sources

How to Morph Planar Graph Drawings [PDF]

SIAM journal on computing (Print), 2016
Given an $n$-vertex graph and two straight-line planar drawings of the graph that have the same faces and the same outer face, we show that there is a morph (i.e., a continuous transformation) between the two drawings that preserves straight-line ...
Soroush Alamdari, Patrizio Angelini, F. Barrera-Cruz, Timothy M. Chan, G. D. Lozzo, G. Battista, Fabrizio Frati, P. Haxell, A. Lubiw, M. Patrignani, Vincenzo Roselli, Sahil Singla, Bryan T. Wilkinson   +12 more
semanticscholar   +1 more source

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

Computation
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