Results 231 to 240 of about 117,345 (255)
Some of the next articles are maybe not open access.
Bichromatic Point-Set Embeddings of Trees with Fewer Bends
2014Let G be a planar graph such that each vertex of G is colored by either red or blue color. Assume that there are nr red vertices and n b blue vertices in G. Let S be a set of fixed points in the plane such that |S| = n r + n b where nr points in S are colored by red color and nb points in S are colored by blue color.
Khaled Mahmud Shahriar +1 more
openaire +2 more sources
Orthogonal point-set embeddings of 3-connected and 4-connected planar graphs
14th International Conference on Computer and Information Technology (ICCIT 2011), 2011An orthogonal point-set embedding of a planar graph G on a set S of points in Euclidean plane is a drawing of G where each vertex of G is placed on a point of S, each edge is drawn as a sequence of alternate horizontal and vertical line segments and any two edges do not cross except at their common end.
Md. Emran Chowdhury, Md. Saidur Rahman
openaire +1 more source
On Point Set Embeddings for k-Planar Graphs with Few Bends per Edge
2019We consider the point set embedding problem (PSE) for 1-, 2- and k-planar graphs where at most 1, 2, or k crossings resp. are allowed for each edge which greatly extends the well-researched class of planar graphs. For any set of n points and any given embedded graph that belongs to one of the above graph classes, we compute a 1-to-1 mapping of the ...
openaire +1 more source
Straight Line Embeddings of Planar Graphs on Point Sets [PDF]
, 1996 Netzahualcoyotl Castañeda +1 more
openaire +1 more source
On Directed Graphs with an Upward Straight-line Embedding into Every Point Set
2009In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is mapped to a point of S, each edge is drawn as a straight-line segment, and all the edges are oriented according to a common direction.
BINUCCI, Carla +6 more
openaire +2 more sources
Characterizing the Complexity of Weighted Networks via Graph Embedding and Point Pattern Analysis
Entropy, 2020Shuo Chen, Qiong Wu, Peter Kochunov
exaly
3D Instance Embedding Learning With a Structure-Aware Loss Function for Point Cloud Segmentation
IEEE Robotics and Automation Letters, 2020Zhidong Liang, Ming Yang, Hao Li
exaly