担忧
发表于 2025-3-26 21:09:17
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:33
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:33
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:34
http://reply.papertrans.cn/39/3880/387920/387920_34.png
Armory
发表于 2025-3-27 15:25:22
http://reply.papertrans.cn/39/3880/387920/387920_35.png
以烟熏消毒
发表于 2025-3-27 20:20:02
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:23
http://reply.papertrans.cn/39/3880/387920/387920_37.png
Petechiae
发表于 2025-3-28 02:45:31
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:49
http://reply.papertrans.cn/39/3880/387920/387920_39.png
Dappled
发表于 2025-3-28 11:03:37
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