exceptional
发表于 2025-3-27 00:53:15
Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphseach edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing..In a recent paper, we showed how to test, for inner-triangulated planar graphs, whether they have a planar open weak
helper-T-cells
发表于 2025-3-27 02:29:42
http://reply.papertrans.cn/39/3880/387901/387901_32.png
水獭
发表于 2025-3-27 08:18:00
Planar Lombardi Drawings for Subcubic Graphss around every vertex. Our construction is based on the Koebe–Andreev–Thurston circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyperbolic geometry. We also use circle packing to const
乐章
发表于 2025-3-27 09:39:03
http://reply.papertrans.cn/39/3880/387901/387901_34.png
Inoperable
发表于 2025-3-27 16:09:18
http://reply.papertrans.cn/39/3880/387901/387901_35.png
反叛者
发表于 2025-3-27 18:13:09
Planar Graphs as VPG-Graphsgraphs are ..-VPG and this was conjectured to be tight. We disprove this conjecture by showing that all planar graphs are ..-VPG. We also show that the 4-connected planar graphs are a subclass of the intersection graphs of Z-shapes (i.e., a special case of ..-VPG). Additionally, we demonstrate that
corn732
发表于 2025-3-27 23:26:18
On Representing Graphs by Touching Cuboidsare represented by a proper contact between the cuboids representing their endvertices. Two cuboids make a proper contact if they intersect and their intersection is a non-zero area rectangle contained in the boundary of both. We study representations where all cuboids are unit cubes, where they are
outset
发表于 2025-3-28 05:00:03
http://reply.papertrans.cn/39/3880/387901/387901_38.png
Bridle
发表于 2025-3-28 09:18:40
http://reply.papertrans.cn/39/3880/387901/387901_39.png
沉着
发表于 2025-3-28 11:08:01
Counting Plane Graphs: Cross-Graph Charging Schemes the set of all crossing-free straight-edge graphs that can be embedded over a specific point set..We then show how to apply the cross-graph charging-scheme method for graphs that allow certain types of crossings. Specifically, we consider graphs with no set of . pairwise-crossing edges (more common