检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

35 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

37 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

32 篇 工学
- 20 篇 建筑学
- 20 篇 土木工程
- 20 篇 测绘科学与技术
- 13 篇 计算机科学与技术...
- 8 篇 软件工程
- 1 篇 信息与通信工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
20 篇 理学
- 19 篇 数学
- 1 篇 生物学
3 篇 管理学
- 3 篇 管理科学与工程(可...
1 篇 农学
- 1 篇 作物学

主题

14 篇 drawing (graphic...
8 篇 visualization
6 篇 graph theory
1 篇 program debuggin...
1 篇 graph embeddings
1 篇 software enginee...
1 篇 large dataset
1 篇 computer appl. i...
1 篇 computer graphic...
1 篇 binary trees
1 篇 discrete mathema...
1 篇 directed graphs
1 篇 clustering algor...
1 篇 data structures
1 篇 algorithm analys...
1 篇 heuristic algori...

机构

3 篇 wilhelm-schickha...
3 篇 università degli...
2 篇 lg theoretische ...
2 篇 university of pe...
2 篇 lehrstuhl für in...
2 篇 roma tre univers...
2 篇 department of ma...
2 篇 department of co...
2 篇 univ wurzburg wu...
1 篇 tu eindhoven ein...
1 篇 national institu...
1 篇 univ waterloo wa...
1 篇 st petersburg st...
1 篇 universität tübi...
1 篇 institut für inf...
1 篇 univ politecn ca...
1 篇 agenzia entrate ...
1 篇 department of co...
1 篇 university of li...
1 篇 university of ca...

作者

5 篇 kaufmann michael
4 篇 liotta giuseppe
4 篇 montecchiani fab...
3 篇 kobourov stephen
3 篇 biedl therese
3 篇 mchedlidze tamar...
3 篇 hong seok-hee
3 篇 rutter ignaz
3 篇 didimo walter
3 篇 tappini alessand...
3 篇 wolff alexander
3 篇 kindermann phili...
2 篇 angelini patrizi...
2 篇 frati fabrizio
2 篇 eades peter
2 篇 chaplick steven
2 篇 radermacher marc...
2 篇 heinsohn niklas
2 篇 di giacomo emili...
2 篇 lipp fabian

语言

37 篇 英文

检索条件"任意字段=25th International Symposium on Graph Drawing and Network Visualization, GD 2017"

共 37 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

MLSEB: Edge bundling using moving least squares approximation 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Wu, Jieting Zeng, Jianping Zhu, Feiyu Yu, Hongfeng University of Nebraska-Lincoln LincolnNE68588 United States

ISBN: (纸本)9783319739144

Edge bundling methods can effectively alleviate visual clutter and reveal high-level graph structures in large graph visualization. Researchers have devoted significant efforts to improve edge bundling according to different metrics. As the edge bundling family evolve rapidly, the quality of edge bundles receives increasing attention in the literature accordingly. In this paper, we present MLSEB, a novel method to generate edge bundles based on moving least squares (MLS) approximation. In comparison with previous edge bundling methods, we argue that our MLSEB approach can generate better results based on a quantitative metric of quality, and also ensure scalability and the efficiency for visualizing large graphs. © Springer international Publishing AG 2018.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Aligned drawings of planar graphs 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： McHedlidze, Tamara Radermacher, Marcel Rutter, Ignaz Department of Computer Science Karlsruhe Institute of Technology Karlsruhe Germany Department of Mathematics and Computer Science TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9783319739144

Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and A is a planar polyline drawing Γ of G with an arrangement A of lines so that Γ and A are homeomorphic to G and A We show that if A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and A have a straight-line aligned drawing. In order to prove these results, we strengthen the result of Da Lozzo et al. [5], and prove that a planar graph G and a single pseudoline L have an aligned drawing with a prescribed 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 NP hard but fixed-parameter tractable. © Springer international Publishing AG 2018.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

1-fan-bundle-planar drawings of graphs 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Angelini, Patrizio Bekos, Michael A. Kaufmann, Michael Kindermann, Philipp Schneck, thomas Institut für Informatik Universität Tübingen Tübingen Germany LG Theoretische Informatik FernUniversität in Hagen Hagen Germany

ISBN: (纸本)9783319739144

Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established near-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the recently introduced fan-planar graphs. In particular, we restrict the bundling to the endsegments of the edges. Similarly to 1-planarity, we call our model 1-fan-bundle-planarity, as we allow at most one crossing per bundle. For the two variants where we allow either one or, more naturally, both endsegments of each edge to be part of bundles, we present edge density results and consider various recognition questions, not only for general graphs, but also for the outer and 2-layer variants. We conclude with a series of challenging questions. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

An interactive tool to explore and improve the ply number of drawings 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Heinsohn, Niklas Kaufmann, Michael Wilhelm-Schickhard-Institut für Informatik Universität Tübingen Tübingen Germany

ISBN: (纸本)9783319739144

Given a straight-line drawing Γ of a graph G = (V,E), for every vertex v the ply disk Dv is defined as a disk centered at v where the radius of the disk is half the length of the longest edge incident to v. the ply number of a given drawing is defined as the maximum number of overlapping disks at some point in IR2. Here we present a tool to explore and evaluate the ply number for graphs with instant visual feedback for the user. We evaluate our methods in comparison to an existing ply computation by De Luca et al. [WALCOM’17]. We are able to reduce the computation time from seconds to milliseconds for given drawings and thereby contribute to further research on the ply topic by providing an efficient tool to examine graphs extensively by user interaction as well as some automatic features to reduce the ply number. © Springer international Publishing AG 2018.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

GiViP: A visual profiler for distributed graph processing systems 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Arleo, Alessio Didimo, Walter Liotta, Giuseppe Montecchiani, Fabrizio Università degli Studi di Perugia Perugia Italy

ISBN: (纸本)9783319739144

Analyzing large-scale graphs provides valuable insights in different application scenarios. While many graph processing systems working on top of distributed infrastructures have been proposed to deal with big graphs, the tasks of profiling and debugging their massive computations remain time consuming and error-prone. this paper presents GiViP, a visual profiler for distributed graph processing systems based on a Pregel-like computation model. GiViP captures the huge amount of messages exchanged throughout a computation and provides an interactive user interface for the visual analysis of the collected data. We show how to take advantage of GiViP to detect anomalies related to the computation and to the infrastructure, such as slow computing units and anomalous message patterns. © Springer international Publishing AG 2018.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Experimental analysis of the accessibility of drawings with few segments 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Kindermann, Philipp Meulemans, Wouter Schulz, André LG Theoretische Informatik FernUniversität in Hagen Hagen Germany Department of Mathematics and Computer Science TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9783319739144

the visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.g., one needs only one line segment to draw two collinear incident edges. We study the question if drawings with few segments have a better aesthetic appeal and help the user to asses the underlying graph. We design an experiment that investigates two different graph types (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. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Biedl, therese Irvine, Veronika David R. Cheriton School of Computer Science University of Waterloo Waterloo Canada

ISBN: (纸本)9783319739144

In this paper, we study a class of graph drawings that arise from bobbin lace patterns. the drawings are periodic and require a combinatorial embedding 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 around the minor meridian axis and zero times around the major longitude axis. We provide an algorithm for finding the two fundamental cycles of a canonical rectangular schema in a supergraph that enforces this topological constraint. the polygonal schema is then used to produce a straight-line drawing 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. © Springer international Publishing AG 2018.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Visualizing Co-phylogenetic reconciliations 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Calamoneri, Tiziana Di Donato, Valentino Mariottini, Diego Patrignani, Maurizio Computer Science Department University of Rome "Sapienza" Rome Italy Engineering Department Roma Tre University Rome Italy

ISBN: (纸本)9783319739144

We introduce a hybrid metaphor for the visualization of the reconciliations of co-phylogenetic trees, that are mappings among the nodes of two trees. the typical application is the visualization of the co-evolution of hosts and parasites in biology. Our strategy combines a space-filling and a node-link approach. Differently from traditional methods, it guarantees an unambiguous and ‘downward’ representation whenever the reconciliation is time-consistent (i.e., meaningful). We address the problem of the minimization of the number of crossings in the representation, by giving a characterization of planar instances and by establishing the complexity of the problem. Finally, we propose heuristics for computing representations with few crossings. © Springer international Publishing AG 2018.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

On smooth orthogonal and octilinear drawings: Relations, complexity and Kandinsky drawings 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Bekos, Michael A. Förster, Henry Kaufmann, Michael Wilhelm-Schickhard-Institut für Informatik Universität Tübingen Tübingen Germany

ISBN: (纸本)9783319739144

We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove NP-hardness for a restricted version 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. © Springer international Publishing AG 2018.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

Limitations on Realistic Hyperbolic graph drawing 29th

Limitations on Realistic Hyperbolic Graph Drawing

引用

29th international symposium on graph drawing and network visualization, gd 2021

作者： Eppstein, David Computer Science Department University of California Irvine IrvineCA92697 United States

ISBN: (纸本)9783030929305

We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean distance. therefore, for these types of drawing, hyperbolic geometry provides no benefit over Euclidean graph drawing. © 2021, Springer Nature Switzerland AG.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共4页 << < 1 2 3 4 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：