找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: ;

[復制鏈接]
樓主: Addendum
31#
發(fā)表于 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
32#
發(fā)表于 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
33#
發(fā)表于 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
34#
發(fā)表于 2025-3-27 13:26:34 | 只看該作者
35#
發(fā)表于 2025-3-27 15:25:22 | 只看該作者
36#
發(fā)表于 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
37#
發(fā)表于 2025-3-28 00:42:23 | 只看該作者
38#
發(fā)表于 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
39#
發(fā)表于 2025-3-28 09:59:49 | 只看該作者
40#
發(fā)表于 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
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-5 08:19
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
武宁县| 江阴市| 鄂托克旗| 财经| 韶关市| 黄陵县| 定远县| 怀化市| 大关县| 阳曲县| 东城区| 乌审旗| 枣强县| 镶黄旗| 西畴县| 武城县| 乌兰察布市| 高碑店市| 石景山区| 华蓥市| 邵阳市| 景德镇市| 邯郸市| 施甸县| 太湖县| 庄浪县| 苍溪县| 游戏| 偃师市| 军事| 竹溪县| 屏东市| 洪湖市| 淮滨县| 广汉市| 西昌市| 社会| 沙坪坝区| 会东县| 南召县| 芜湖县|