Výsledky vyhledávání - "Edge crossing"

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.

Snapshot Visualization of Complex Graphs with Force-Directed Algorithms

Publikováno v: ICBK

Force-directed algorithms are widely used for visualizing graphs. However, these algorithms are computationally expensive in producing good quality layouts for complex graphs. The layout quality is largely influenced by execution time and methods' in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06338dd3c7961828b244878a32fa66c0

Zobrazit plný text záznamu

Dissertation/ Thesis

Interactive Visual Analysis of Hypergraphs

Autor: Chen, ningrui

Access to and understanding data plays an essential role in the increasingly digital world. Representation and analysis of relations between various data entities, i.e., graph and network structures in the data, is an important problem for various in

Externí odkaz: http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-107701

Zobrazit plný text záznamu

Optimized two-dimensional Networks with edge crossing cost: frustrated anti-ferromagnetic spin system

Autor: Pik Yin Lai, An-Liang Cheng

We consider a quasi two-dimensional network connection growth model that minimizes the wiring cost while maximizing the network connections, but at the same time edge crossings are penalized or forbidden. This model is mapped to a dilute anti-ferroma

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f527918ea763639ff243d1bcafe0d917

Zobrazit plný text záznamu

Influence of Shape, Density, and Edge Crossings on the Perception of Graph Differences

Autor: Günter Wallner, Kathrin Ballweg, Margit Pohl, Cynthia Graniczkowska, Tatiana von Landesberger

Publikováno v: Diagrammatic Representation and Inference ISBN: 9783030542481
Diagrams

The perception of differences between graphs represented as node-link diagrams is an important issue in many disciplines. This paper presents results from a study with 40 participants. The goal of the study was to test whether shape, density, and edg

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::1d91790d632098f6315134f20bd627f8
https://doi.org/10.1007/978-3-030-54249-8_27

Zobrazit plný text záznamu

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.

Akademický článek

Barriles de absorción y contención del impacto: reducción de mortalidad por accidentes de tránsito Impact-absorbing and containment barriers: reduction in accident mortality

Autor: Carlos Arreola-Rissa, Jesús Santos-Guzmán, Adol Esquivel-Guzmán, Charles Mock, Alejandro Herrera-Escamilla

Publikováno v: Salud Pública de México, Vol 50, Pp s55-s59 (2008)

OBJETIVO: Determinar el efecto en la reducción de la mortalidad por accidentes de tránsito de la instalación de un dispositivo de absorción y contención de impacto (BAFI),en cruceros de eje estrecho en la ciudad de Monterrey, México. MATERIAL Y

Externí odkaz: https://doaj.org/article/5b5f6d1539d24511bf8e3fc30cf51ef8

Zobrazit plný text záznamu

Improvement of layered directed acyclic graph layout in CourseViewer

Autor: Celmar Guimaraes da Silva, Geovana Marinello Palomo

Publikováno v: Revista dos Trabalhos de Iniciação Científica da UNICAMP.

CourseViewer is a software that uses interactive diagrams to assist students, teachers, and course coordinators in analyzing information related to academic transcripts and course curriculum, which are represented as layered directed acyclic graphs o

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ef585c01b3d3f563ceae6464047c95a0
https://doi.org/10.20396/revpibic262018524

Zobrazit plný text záznamu

Crossing Numbers of Beyond-Planar Graphs

Autor: Pavel Valtr, Markus Chimani, Philipp Kindermann, Fabrizio Montecchiani

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030358013
Graph Drawing

We study the 1-planar, quasi-planar, and fan-planar crossing number in comparison to the (unrestricted) crossing number of graphs. We prove that there are $n$-vertex 1-planar (quasi-planar, fan-planar) graphs such that any 1-planar (quasi-planar, fan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b8b5b6e796c211ee91d4c82ffac7cfc8
https://doi.org/10.1007/978-3-030-35802-0_6

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání