書目名稱Graph Drawing and Network Visualization影響因子(影響力)學(xué)科排名
書目名稱Graph Drawing and Network Visualization網(wǎng)絡(luò)公開度
書目名稱Graph Drawing and Network Visualization網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Graph Drawing and Network Visualization被引頻次
書目名稱Graph Drawing and Network Visualization被引頻次學(xué)科排名
書目名稱Graph Drawing and Network Visualization年度引用
書目名稱Graph Drawing and Network Visualization年度引用學(xué)科排名
書目名稱Graph Drawing and Network Visualization讀者反饋
書目名稱Graph Drawing and Network Visualization讀者反饋學(xué)科排名
作者: confederacy 時間: 2025-3-21 22:25
https://doi.org/10.1007/978-94-011-1922-1g. We show non-trivial relationships between the ply number and the vertex-ply number. Then, we focus on empty-ply drawings, proving some properties and studying what classes of graphs admit such drawings. Finally, we prove a lower bound on the ply and the vertex-ply of planar drawings.作者: Biomarker 時間: 2025-3-22 00:59 作者: languid 時間: 2025-3-22 08:09 作者: 變量 時間: 2025-3-22 08:56
Aligned Drawings of Planar Graphscribed convex drawing of the outer face. We also study the more general version of the problem where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is .-hard but fixed-parameter tractable.作者: Affable 時間: 2025-3-22 13:23 作者: Affable 時間: 2025-3-22 17:18 作者: 完整 時間: 2025-3-23 00:33
Grid-Obstacle Representations with Connections to Staircase Guardingow that then grid-obstacle representations exist for bipartite graphs. The latter has applications in so-called . of orthogonal polygons; using our grid-obstacle representations, we show that staircase guarding is .-hard in 2D.作者: VOK 時間: 2025-3-23 01:25
On the Edge-Length Ratio of Outerplanar Graphs.. We also show that every bipartite outerplanar graph has a planar straight-line drawing with edge-length ratio 1, and that, for any ., there exists an outerplanar graph with a given combinatorial embedding such that any planar straight-line drawing has edge-length ratio greater than?..作者: 智力高 時間: 2025-3-23 06:51 作者: 漸強 時間: 2025-3-23 12:37
https://doi.org/10.1057/9780230615472drawing (where edges are composed of two circular arcs). Further, every knot is ., that is, it can be drawn as Lombardi drawing when relaxing the angular resolution requirement by an arbitrary small angular offset?., while maintaining a . angle between opposite edges.作者: 珠寶 時間: 2025-3-23 17:37 作者: 陶醉 時間: 2025-3-23 22:04 作者: FLIP 時間: 2025-3-24 02:02 作者: 整頓 時間: 2025-3-24 05:18
Drawing Bobbin Lace Graphs, or, Fundamental Cycles for a Subclass of Periodic Graphsing of the lace graph inside a rectangular frame. We argue that such a polygonal schema always exists for combinatorial embeddings satisfying the conditions of bobbin lace patterns, and that we can therefore create a pattern, given a graph with a fixed combinatorial embedding of genus one.作者: Overthrow 時間: 2025-3-24 09:26
Migration Literature and Hybridity.. We also show that every bipartite outerplanar graph has a planar straight-line drawing with edge-length ratio 1, and that, for any ., there exists an outerplanar graph with a given combinatorial embedding such that any planar straight-line drawing has edge-length ratio greater than?..作者: 小步走路 時間: 2025-3-24 11:42 作者: exclusice 時間: 2025-3-24 16:00
https://doi.org/10.1057/9780230619098ally convex polygons, where . and . are the number of vertices and edges in the visibility graph, respectively. We further show that reconstructing a monotone chain of staircases (a histogram) is fixed-parameter tractable, when parameterized on the number of tabs, and polynomially solvable in time . under reasonable alignment restrictions.作者: Brain-Waves 時間: 2025-3-24 19:04 作者: Laconic 時間: 2025-3-25 00:34
Experimental Analysis of the Accessibility of Drawings with Few Segmentspes (trees and sparse graphs), three different layout algorithms for trees, and two different layout algorithms for sparse graphs. We asked the users to give an aesthetic ranking on the layouts and to perform a furthest-pair or shortest-path task on the drawings.作者: 鄙視 時間: 2025-3-25 05:03
Reconstructing Generalized Staircase Polygons with Uniform Step Lengthally convex polygons, where . and . are the number of vertices and edges in the visibility graph, respectively. We further show that reconstructing a monotone chain of staircases (a histogram) is fixed-parameter tractable, when parameterized on the number of tabs, and polynomially solvable in time . under reasonable alignment restrictions.作者: 無法取消 時間: 2025-3-25 09:07
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawingsersion of the bendless drawing problem for both models. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.作者: 生命 時間: 2025-3-25 14:24
Aligned Drawings of Planar Graphsolyline drawing . of . with an arrangement . of lines so that . and . are homeomorphic to . and .. We show that if . is stretchable and every edge . either entirely lies on a pseudoline or intersects at most one pseudoline, then . and . have a straight-line aligned drawing. In order to prove these r作者: 泥土謙卑 時間: 2025-3-25 16:29 作者: 使苦惱 時間: 2025-3-25 20:44 作者: cornucopia 時間: 2025-3-26 03:53 作者: 最后一個 時間: 2025-3-26 07:16 作者: aerial 時間: 2025-3-26 09:22 作者: 不能仁慈 時間: 2025-3-26 13:50 作者: wreathe 時間: 2025-3-26 17:37 作者: 擔(dān)憂 時間: 2025-3-26 21:09
3D Visibility Representations of 1-planar Graphstic disjoint rectangles parallel to the .-plane, and the edges are unobstructed .-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility represen作者: inveigh 時間: 2025-3-27 03:00
Lombardi Drawings of Knots and Links point in .. These diagrams are drawings of 4-regular plane multigraphs. Knots are typically smooth curves in ., so their projections should be smooth curves in . with good continuity and large crossing angles: exactly the properties of Lombardi graph drawings (defined by circular-arc edges and perf作者: Conducive 時間: 2025-3-27 07:14
Arrangements of Pseudocircles: Triangles and Drawingsed them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells . in digon-free arrangements of . pairwise intersecting pseudocircles is at least .. We present examples to disprove this conjecture. With a recur作者: Conflict 時間: 2025-3-27 13:26 作者: Armory 時間: 2025-3-27 15:25 作者: 以煙熏消毒 時間: 2025-3-27 20:20
Thrackles: An Improved Upper Boundhat any thrackle of . vertices has at most 1.3984. edges. . are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an . number of times. It is also shown that the maximum number of edges of a quasi-thrackle on . vertices is ., and that this bound is be作者: embolus 時間: 2025-3-28 00:42 作者: Petechiae 時間: 2025-3-28 02:45
https://doi.org/10.1007/978-981-10-2708-6olyline drawing . of . with an arrangement . of lines so that . and . are homeomorphic to . and .. We show that if . is stretchable and every edge . either entirely lies on a pseudoline or intersects at most one pseudoline, then . and . have a straight-line aligned drawing. In order to prove these r作者: Adenoma 時間: 2025-3-28 09:59 作者: Dappled 時間: 2025-3-28 11:03
https://doi.org/10.1007/978-94-011-1922-1tex with radius equal to half the length of the longest edge incident to the vertex. The vertex-ply of a drawing is determined by the vertex covered by the maximum number of disks. The main motivation for considering this relaxation is to relate the concept of ply to proximity drawings. In fact, if 作者: 稱贊 時間: 2025-3-28 17:04 作者: 財產(chǎn) 時間: 2025-3-28 19:16 作者: Migratory 時間: 2025-3-29 01:33 作者: Recess 時間: 2025-3-29 04:58
https://doi.org/10.1007/978-3-319-51649-3if and only if an .-monotone grid path connects the two endpoints without hitting an obstacle or another vertex. It was previously argued that all planar graphs have a grid-obstacle representation in 2D, and all graphs have a grid-obstacle representation in 3D. In this paper, we show that such const作者: larder 時間: 2025-3-29 07:33
https://doi.org/10.1057/9780230619098 recognition is known to be in PSPACE). We show that two classes of uniform step length polygons can be reconstructed efficiently by finding and removing rectangles formed between consecutive convex boundary vertices called tabs. In particular, we give an .-time reconstruction algorithm for orthogon作者: 鬼魂 時間: 2025-3-29 14:57
https://doi.org/10.1007/978-3-031-19153-4tic disjoint rectangles parallel to the .-plane, and the edges are unobstructed .-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility represen作者: glisten 時間: 2025-3-29 19:04 作者: Interstellar 時間: 2025-3-29 21:23
https://doi.org/10.1007/978-3-658-41670-6ed them as collections of simple closed curves that pairwise intersect in exactly two crossings. Grünbaum conjectured that the number of triangular cells . in digon-free arrangements of . pairwise intersecting pseudocircles is at least .. We present examples to disprove this conjecture. With a recur作者: 緯度 時間: 2025-3-30 03:54
https://doi.org/10.1007/978-3-030-66988-1g with specific properties which we outline and demonstrate can be verified in linear time. In addition, a lace graph drawing has a topological requirement: it contains a set of non-contractible directed cycles which must be homotopic to (1,?0), that is, when drawn on a torus, each cycle wraps once 作者: 依法逮捕 時間: 2025-3-30 07:29 作者: 合法 時間: 2025-3-30 10:02
https://doi.org/10.1007/978-3-030-69399-2hat any thrackle of . vertices has at most 1.3984. edges. . are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an . number of times. It is also shown that the maximum number of edges of a quasi-thrackle on . vertices is ., and that this bound is be作者: Triglyceride 時間: 2025-3-30 15:17 作者: 冒號 時間: 2025-3-30 19:36
https://doi.org/10.1007/978-3-031-19153-4tic disjoint rectangles parallel to the .-plane, and the edges are unobstructed .-parallel visibilities between pairs of rectangles. In addition, the constructed representation is such that there is a plane that intersects all the rectangles, and this intersection defines a bar 1-visibility representation of ..作者: Bumptious 時間: 2025-3-30 22:37 作者: 打算 時間: 2025-3-31 04:24
https://doi.org/10.1007/978-3-030-69399-2hat any thrackle of . vertices has at most 1.3984. edges. . are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an . number of times. It is also shown that the maximum number of edges of a quasi-thrackle on . vertices is ., and that this bound is best possible for infinitely many values of ..作者: 難解 時間: 2025-3-31 06:14 作者: Chemotherapy 時間: 2025-3-31 09:52
Many Touchings Force Many Crossingsdoes not get from one side of the second curve to its other side. Otherwise, if the two curves intersect, they are said to form a . pair. Let . and . denote the number of touching pairs and crossing pairs, respectively. We prove that ., provided that .. Apart from the values of the constants, this result is best possible.作者: Yag-Capsulotomy 時間: 2025-3-31 15:13 作者: palliate 時間: 2025-3-31 19:44 作者: separate 時間: 2025-4-1 01:30
Arrangements of Pseudocircles: Triangles and Drawings pairwise intersecting arrangements of pseudocircles, we show that .. This is essentially best possible because families of pairwise intersecting arrangements of . pseudocircles with . as . are known..The paper contains many drawings of arrangements of pseudocircles and a good fraction of these draw
