Pole Dancing: 3D Morphs for Tree Drawings
| Autor: | Fabrizio Frati, Pilar Cano, Vida Dujmović, Alessandra Tappini, Stefan Langerman, Elena Arseneva, Prosenjit Bose, Anthony D’Angelo |
|---|---|
| Přispěvatelé: | Therese C. Biedl and Andreas Kerren, Arseneva, Elena, Bose, Prosenjit, Cano, Pilar, D'Angelo, Anthony, Dujmovic, Vida, Frati, Fabrizio, Langerman, Stefan, Tappini, Alessandra, Arseneva, E., Bose, P., Cano, P., D’Angelo, A., Dujmovic, V., Frati, F., Langerman, S., Tappini, A., Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. CGA -Computational Geometry and Applications, Universitat Politècnica de Catalunya. CGA - Computational Geometry and Applications |
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: |
Computational Geometry (cs.CG)
FOS: Computer and information sciences General Computer Science Computer science Drawing Gràfics 0102 computer and information sciences 02 engineering and technology 01 natural sciences Theoretical Computer Science Combinatorics Tree (descriptive set theory) Computer Science - Data Structures and Algorithms FOS: Mathematics 0202 electrical engineering electronic engineering information engineering Mathematics - Combinatorics Data Structures and Algorithms (cs.DS) Mathematics Infografia tridimensional Small number Dibuix Knot theory Binary logarithm 16. Peace & justice Computer Science Applications Morphing Computational Theory and Mathematics 010201 computation theory & mathematics Matemàtiques i estadística::Anàlisi matemàtica [Àrees temàtiques de la UPC] Computer Science - Computational Geometry 020201 artificial intelligence & image processing Geometry and Topology Combinatorics (math.CO) Nusos Teoria de Matemàtiques i estadística::Geometria [Àrees temàtiques de la UPC] Charts diagrams etc |
| Zdroj: | Lecture Notes in Computer Science Lecture Notes in Computer Science-Graph Drawing and Network Visualization Lecture Notes in Computer Science ISBN: 9783030044138 Graph Drawing Recercat. Dipósit de la Recerca de Catalunya instname UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Graph Drawing and Network Visualization-26th International Symposium, GD 2018, Barcelona, Spain, September 26-28, 2018, Proceedings Journal of Graph Algorithms and Applications |
| ISSN: | 0302-9743 1611-3349 |
| Popis: | We study the question whether a crossing-free 3D morph between two straight-line drawings of an $n$-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-dimensional and at the one in which they are three-dimensional. In the former setting we prove that a crossing-free 3D morph always exists with $O(\log n)$ steps, while for the latter $\Theta(n)$ steps are always sufficient and sometimes necessary. Comment: Appears in the Proceedings of the 26th International Symposium on Graph Drawing and Network Visualization (GD 2018) |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|