Toeda et al., 2016 - Google Patents
On edge bundling and node layout for mutually connected directed graphsToeda et al., 2016
View PDF- Document ID
- 8643807090060530544
- Author
- Toeda N
- Nakazawa R
- Itoh T
- Saito T
- Archambault D
- Publication year
- Publication venue
- 2016 20th International Conference Information Visualisation (IV)
External Links
Snippet
Directed graphs are used to represent variety of information, including friendship on social networking services (SNS), pathways of genes, and citations of research papers. Graph drawing is useful to intuitively represent such datasets. This paper presents an edge …
- 238000000034 method 0 abstract description 49
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30994—Browsing or visualization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/206—Drawing of charts or graphs
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/36—Image preprocessing, i.e. processing the image information without deciding about the identity of the image
- G06K9/46—Extraction of features or characteristics of the image
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06K—RECOGNITION OF DATA; PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS
- G06K9/00—Methods or arrangements for reading or recognising printed or written characters or for recognising patterns, e.g. fingerprints
- G06K9/62—Methods or arrangements for recognition using electronic means
- G06K9/6217—Design or setup of recognition systems and techniques; Extraction of features in feature space; Clustering techniques; Blind source separation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F2217/00—Indexing scheme relating to computer aided design [CAD]
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Gansner et al. | Multilevel agglomerative edge bundling for visualizing large graphs | |
Zhou et al. | Edge bundling in information visualization | |
Ghaseminezhad et al. | A novel self-organizing map (SOM) neural network for discrete groups of data clustering | |
Ersoy et al. | Skeleton-based edge bundling for graph visualization | |
Xiao et al. | CAD mesh model segmentation by clustering | |
Martins et al. | Visual analysis of dimensionality reduction quality for parameterized projections | |
JP5511485B2 (en) | Animation planning method and apparatus for dynamic graph | |
Pupyrev et al. | Edge routing with ordered bundles | |
Itoh et al. | Key-node-separated graph clustering and layouts for human relationship graph visualization | |
CN106649817B (en) | Method and device for constructing and lofting three-dimensional pipe model of geographic information system | |
CN110807379B (en) | Semantic recognition method, semantic recognition device and computer storage medium | |
CN107451183B (en) | Knowledge Map construction method based on text cluster thought | |
CN108073695B (en) | High-dimensional time-varying data visualization method for enhancing visual perception of dimension-reduced space | |
Yuan et al. | Feature preserving multiresolution subdivision and simplification of point clouds: A conformal geometric algebra approach | |
CN104361625B (en) | A kind of cloud data compaction algorithm retained with border based on ray principle | |
Cupertino et al. | Data clustering using controlled consensus in complex networks | |
Zielasko et al. | Interactive 3D force‐directed edge bundling | |
Toeda et al. | On edge bundling and node layout for mutually connected directed graphs | |
Kim et al. | Exmeshcnn: An explainable convolutional neural network architecture for 3d shape analysis | |
Wang et al. | Geometric decomposition of 3D surface meshes using Morse theory and region growing | |
Toeda et al. | Convergent drawing for mutually connected directed graphs | |
Hu et al. | Spectrum-based network visualization for topology analysis | |
Strong et al. | Browsing a large collection of community photos based on similarity on GPU | |
Sassa et al. | 3D visualization of network including nodes with labels | |
Zafar et al. | Extract and characterize hairpin vortices in turbulent flows |