A5063119503- Computational Geometry and Mesh Generation
- Advanced Graph Theory Research
- Data Visualization and Analytics
- 3D Modeling in Geospatial Applications
- Optimization and Search Problems
- Digital Image Processing Techniques
- Data Management and Algorithms
- Advanced Numerical Analysis Techniques
- Graph Theory and Algorithms
- Computer Graphics and Visualization Techniques
- Algorithms and Data Compression
- Software Testing and Debugging Techniques
- 3D Shape Modeling and Analysis
- Multimedia Communication and Technology
- VLSI and FPGA Design Techniques
- Manufacturing Process and Optimization
- Video Analysis and Summarization
- Complexity and Algorithms in Graphs
- graph theory and CDMA systems
- Topological and Geometric Data Analysis
- Structural Analysis and Optimization
- Constraint Satisfaction and Optimization
- Advanced Text Analysis Techniques
- Robotic Path Planning Algorithms
- Model-Driven Software Engineering Techniques
University of Perugia
2014-2024
University of Tübingen
2019
In a fan-planar drawing of graph there is no edge that crosses two other independent edges. We study 2-layer drawings, i.e., drawings such the vertices are restricted to distinct horizontal layers and edges straight-line segments connect different layers. characterize drawable graphs describe linear-time testing embedding algorithm for biconnected graphs. also relationship between right-angle crossing
Mixed graphs have both directed and undirected edges received considerable attention in the literature. We study two upward planarity testing problems for embedded mixed graphs, give some NP-hardness results, describe Integer Linear Programming techniques to solve them. Experiments show efficiency of our approach.
Partial Edge Drawing (PED) is a popular graph drawing style aimed at reducing edge crossings and visual clutter. PEDs are straight-line drawings where the central part of each erased, length two remaining segments computed so as to preserve useful geometric information. Recent studies on this approach focus symmetric δ-homogeneous (δ-SHPEDs). Given drawing, δ-SHPED immediately defined for fixed value δ. In particular, some may not be avoidable, although amount ink removed from original might...
A mixed graph has both directed and undirected edges. We study how to compute a crossing-free drawing of an embedded planar graph, such that it is upward ‘as much as possible’. Roughly speaking, in all (undirected) edges are monotone the vertical direction flow monotonically from bottom top according their orientation. quasi-upward drawings graphs, is, where can break monotonicity finite number edge points, called bends. describe efficient heuristic techniques exact approaches for computing...
We study k-page upward book embeddings (kUBEs) of st-graphs, that is, single-source single-sink directed acyclic graphs on k pages with the additional requirement vertices graph appear in a topological ordering along spine book. show testing whether admits kUBE is NP-complete for >= 3. A hardness result this problem was previously known only = 6 [Heath and Pemmaraju, 1999]. Motivated by negative result, we focus our attention k=2. On algorithmic side, present polynomial-time algorithms...
Word clouds are popular graphical representations used to effectively summarize the core content of a document, or set documents. In particular, in semantic word cloud positions words also reflect their correlation. Several algorithms have been proposed literature compute clouds, both static and dynamic setting. However, so far, solutions generate assume that all text changes known advance. this paper we propose new scenario. We receive stream given time period, compute, sort real-time...
Upward planar drawings of digraphs are crossing free where all edges flow in the upward direction. The problem deciding whether a digraph admits an drawing is called planarity testing problem, and it has been widely studied literature. In this paper we investigate new that is, having some special topological properties: such switchregular. Switch-regular have practical algorithmic impacts several graph applications. We provide characterizations for class directed trees admit switch-regular...