渐强
发表于 2025-3-23 12:37:43
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:58
http://reply.papertrans.cn/39/3880/387920/387920_12.png
陶醉
发表于 2025-3-23 22:04:17
http://reply.papertrans.cn/39/3880/387920/387920_13.png
FLIP
发表于 2025-3-24 02:02:25
http://reply.papertrans.cn/39/3880/387920/387920_14.png
整顿
发表于 2025-3-24 05:18:55
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:00
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:39
http://reply.papertrans.cn/39/3880/387920/387920_17.png
exclusice
发表于 2025-3-24 16:00:36
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:44
http://reply.papertrans.cn/39/3880/387920/387920_19.png
Laconic
发表于 2025-3-25 00:34:52
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.