Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Gansner, Emden R."'
Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also respect a
Externí odkaz:
http://arxiv.org/abs/1308.5218
Autor:
Das, Aparna, Gansner, Emden R., Kaufmann, Michael, Kobourov, Stephen, Spoerhase, Joachim, Wolff, Alexander
We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \emph{terminals} in $\R^d$, find a minimum-length network such that each pair of terminals is connected by a set of axis-parallel line segments
Externí odkaz:
http://arxiv.org/abs/1107.0901
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of planar graphs that cannot be represented by pentagons. We also show that
Externí odkaz:
http://arxiv.org/abs/1104.1482
In this paper, we consider the problem of representing graphs by triangles whose sides touch. As a simple necessary condition, we show that pairs of vertices must have a small common neighborhood. On the positive side, we present linear time algorith
Externí odkaz:
http://arxiv.org/abs/1001.2862
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these traditional method
Externí odkaz:
http://arxiv.org/abs/0907.2585
Contact graphs of isothetic rectangles unify many concepts from applications including VLSI and architectural design, computational geometry, and GIS. Minimizing the area of their corresponding {\em rectangular layouts} is a key problem. We study the
Externí odkaz:
http://arxiv.org/abs/cs/0611107
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Attacks on the routing system, with the goal of diverting traffic past an enemy-controlled point for purposes of eavesdropping or connection-hijacking, have long been known. In principle, at least, these attacks can be countered by use of appropriate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0ffed6d4fc63d7ccd5d2701de8e8fbf