Results 11 to 20 of about 117,345 (255)
Point set embedding in 3D [PDF]
J. Graph Algorithms Appl., 2015 Summary: Given a graph \(G\) with \(n\) vertices and \(m\) edges, and a set \(P\) of \(n\) points on a three-dimensional integer grid, the 3D Point-Set Embeddability problem is to determine a (three-dimensional) crossing-free drawing of \(G\) with vertices located at \(P\) and with edges drawn as poly-lines with bend-points at integer grid points.
Henk Meijer, Stephen K. Wismath
openaire +3 more sources
IEEE Transactions on Visualization and Computer Graphics, 2023 Accepted by IEEE Transactions on Visualization and Computer Graphics (IEEE TVCG), 2022. All resources can be found at https://liruihui.github.io/
Ruihui Li +3 more
openaire +3 more sources
Point-set embeddings of plane 3-trees [PDF]
Computational Geometry, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rahnuma Islam Nishat +2 more
openaire +2 more sources
Orthogeodesic point-set embedding of trees [PDF]
Computational Geometry, 2012 The paper deals with the problem of orthogeodesic point-set embedding of a graph on grid points. In this type of problem we have a graph \(G\), a grid \(S\) of \(N\) points, and we want to draw \(G\) in such a way that each vertex is drawn as a point of \(S\) and each edge is a chain of horizontal and vertical segments with bends on grid points whose ...
Emilio Di Giacomo +4 more
openaire +7 more sources
Upward Point Set Embeddings of Paths and Trees [PDF]
, 2021 We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The given point set $S$ has size at least the number of vertices in the tree. For the special case where the tree is a path $P$ we show that: (a) If $S$ is one-sided convex, the number of UPSEs equals the number of maximal monotone paths in $P$.
Elena Arseneva +6 more
openaire +2 more sources
On the curve complexity of 3-colored point-set embeddings [PDF]
Theoretical Computer Science, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Di Giacomo, Emilio +3 more
openaire +1 more source
Embedding Four-Directional Paths on Convex Point Sets [PDF]
Journal of Graph Algorithms and Applications, 2014 A directed path whose edges are assigned labels "up", "down", "right", or "left" is called four-directional, and three-directional if at most three out of the four labels are used. A direction-consistent embedding of an n-vertex three- or four-directional path P on a set S of n points in the plane is a straight-line drawing of P where each vertex of P ...
Oswin Aichholzer +4 more
openaire +4 more sources
Colored Point-Set Embeddings of Acyclic Graphs [PDF]
, 2018 We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $Ω(n^\frac{2}{3})$ edges each having $Ω(n^\frac{1}{3})$ bends in the worst case. The lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast,
Emilio Di Giacomo +3 more
openaire +3 more sources
Efficient rules for all conformal blocks
Journal of High Energy Physics, 2021 We formulate a set of general rules for computing d-dimensional four-point global conformal blocks of operators in arbitrary Lorentz representations in the context of the embedding space operator product expansion formalism [1].
Jean-François Fortin +3 more
doaj +1 more source
Book Embeddings and Point-Set Embeddings of Series-Parallel Digraphs [PDF]
, 2002 An optimal O(n)-time algorithm to compute an upward two-page book embedding of a series-parallel digraph with n vertices is presented. A previous algorithm of Alzohairi and Rival [1] runs in O(n3) time and assumes that the input series-parallel digraph does not have transitive edges.
DI GIACOMO, Emilio +3 more
openaire +3 more sources