scholarly journals Estimating the Number of Disjoint Edges in Simple Topological Graphs via Cylindrical Drawings

2014 ◽  
Vol 28 (1) ◽  
pp. 116-121 ◽  
Author(s):  
Radoslav Fulek
Keyword(s):  
Topological Graphs

Study on the Method of Planetary Gear Trains Based on Topological Theory

2013 ◽  
Vol 568 ◽  
pp. 169-175 ◽  
Author(s):  
Ya Feng He ◽  
You Ming Wang
Keyword(s):  
Planetary Gear ◽  
Basic Structure ◽  
Graph Representation ◽  
Topological Graphs ◽  
Topological Theory ◽  
Planetary Gear Trains ◽  
Gear Trains ◽  
New System

The method research of planetary gear trains (PGTs) by applying topological theory is very significance in searching for innovative planetary trains. A new graph representation and stratification standard are introduced firstly. Then three topological graphs of basic structure of PGTs are established as the basis of synthesis theory. Next several kinds of planetary trains with small teeth difference and method of isomorphic determination are presented, thus built up the procedure of PGTs by graphs and example. Finally a new system of classification and synthesis for PGTs is put forward according to the feature of loops in topological theory.

scholarly journals Reconstructing facade semantic models using hierarchical topological graphs

2020 ◽  
Vol 24 (4) ◽  
pp. 1073-1097
Author(s):  
Yuefeng Wang ◽  
Hongchao Fan ◽  
Guoqing Zhou
Keyword(s):  
Topological Graphs ◽  
Semantic Models

scholarly journals Disjoint edges in topological graphs and the tangled-thrackle conjecture

2016 ◽  
Vol 51 ◽  
pp. 398-406 ◽  
Author(s):  
Andres J. Ruiz-Vargas ◽  
Andrew Suk ◽  
Csaba D. Tóth
Keyword(s):  
Topological Graphs

scholarly journals Saturated simple and k-simple topological graphs

2015 ◽  
Vol 48 (4) ◽  
pp. 295-310 ◽  
Author(s):  
Jan Kynčl ◽  
János Pach ◽  
Radoš Radoičić ◽  
Géza Tóth
Keyword(s):  
Topological Graphs

Construction of Minimized Topological Graphs on Occupancy Grid Maps Based on GVD and Sensor Coverage Information

2013 ◽  
Vol 75 (3-4) ◽  
pp. 457-474 ◽  
Author(s):  
E. G. Tsardoulias ◽  
A. T. Serafi ◽  
M. N. Panourgia ◽  
A. Papazoglou ◽  
L. Petrou
Keyword(s):  
Sensor Coverage ◽  
Topological Graphs ◽  
Occupancy Grid ◽  
Occupancy Grid Maps

Structural features hidden in the degree distributions of topological graphs

2005 ◽  
Vol 37 (1) ◽  
pp. 37-56 ◽  
Author(s):  
Qian-Nan Hu ◽  
Yi-Zeng Liang ◽  
Qing-Song Xu ◽  
Kai-Tai Fang ◽  
Xiao-Ling Peng ◽  
...  
Keyword(s):  
Structural Features ◽  
Topological Graphs

Autoderivation of Topological Graphs for Type Synthesis of Planar 3DOF Parallel Mechanisms

2009 ◽  
Vol 2 (1) ◽  
Author(s):  
Yi Lu ◽  
Ling Ding ◽  
Jianping Yu
Keyword(s):  
Parallel Mechanisms ◽  
Type Synthesis ◽  
Topological Graph ◽  
Topological Graphs

The autoderivation of valid topological graph (TGs) of planar 3DOF parallel mechanisms is studied systematically based on topology embryonic graphs (TEGs) and arrays. First, some TEGs without any binary links are constructed, some paths with only binary links are distributed over the TEGs, and some valid TGs of the planar 3DOF PMs are derived. Second, a complicated derivation of the TG is transformed into an easy derivation of array. Third, some programs are compiled in VB, all valid arrays corresponding to nonisomorphic TGs are derived automatically, and some invalid arrays corresponding to the isomorphic TGs and invalid TGs are determined by compiled programs. Finally, many valid TGs of planar 3DOF PMs with various basic links are derived from valid arrays.

Derivation of Topological Graphs of Some Planar 4DOF Redundant Closed Mechanisms by Contracted Graphs and Arrays

2010 ◽  
Vol 2 (3) ◽  
Author(s):  
Yi Lu ◽  
Ling Ding ◽  
Shuyan Li ◽  
Jianping Yu
Keyword(s):  
Degrees Of Freedom ◽  
Visual Basic ◽  
Topological Graphs ◽  
And Topology ◽  
Singular Configuration ◽  
Topology Graph

Some planar redundantly closed mechanisms (RCMs) have better dexterity, less singular configuration, and higher stiffness. In this paper, the derivation of valid topology graphs (TGs) of some planar four degrees of freedom (4DOF) RCMs is studied based on the contracted graph (CG), arrays, and topology graph with digits (DTG). First, some CGs without any binary links are constructed for the planar 4DOF RCMs, some curves with only binary links are distributed over CGs, and some valid TGs of the planar 4DOF RCMs are derived. Second, a complicated derivation of TG is transformed into an easy derivation of array and DTG, and some programs are compiled in VISUAL BASIC; all valid arrays corresponding to nonisomorphic TGs are derived, and some invalid arrays corresponding to the isomorphic TGs and invalid TGs are determined and removed by the compiled programs. Third, many valid TGs of the planar 4DOF RCMs with various basic links are derived from valid arrays and DTGs. Finally, some application examples are illustrated.

EVERY OUTER-1-PLANE GRAPH HAS A RIGHT ANGLE CROSSING DRAWING

2012 ◽  
Vol 22 (06) ◽  
pp. 543-557 ◽  
Author(s):  
HOOMAN REISI DEHKORDI ◽  
PETER EADES
Keyword(s):  
Empirical Evidence ◽  
Graph Drawing ◽  
Human Perception ◽  
Plane Graph ◽  
Outer Face ◽  
Input Graph ◽  
Topological Graphs ◽  
Negative Effect ◽  
Edge Crossings ◽  
Do So

There is strong empirical evidence that human perception of a graph drawing is negatively correlated with the number of edge crossings. However, recent experiments show that one can reduce the negative effect by ensuring that the edges that cross do so at large angles. These experiments have motivated a number of mathematical and algorithmic studies of “right angle crossing (RAC)” drawings of graphs, where the edges cross each other perpendicularly. In this paper we give an algorithm for constructing RAC drawings of “outer-1-plane” graphs, that is, topological graphs in which each vertex appears on the outer face, and each edge crosses at most one other edge. The drawing algorithm preserves the embedding of the input graph. This is one of the few algorithms available to construct RAC drawings.

Sign in / Sign up

Export Citation Format

Share Document