Publications (7)
Identifying Cluttering Edges in Near-Planar Graphs
Simon van Wageningen, Tamara Mchedlidze, Alexandru Telea
Planar drawings of graphs tend to be favored over non-planar drawings. Testing planarity and creating a planar layout of a planar graph can be done in linear time. However, creatin…
LCIP: Loss-Controlled Inverse Projection of High-Dimensional Image Data
Yu Wang, Frederik L. Dennig, Michael Behrisch +1
Projections (or dimensionality reduction) methods aim to map high-dimensional data to typically 2D scatterplots for visual exploration. Inverse projection methods aim…
ShaRP: Shape-Regularized Multidimensional Projections
Alister Machado, Alexandru Telea, Michael Behrisch
Projections, or dimensionality reduction methods, are techniques of choice for the visual exploration of high-dimensional data. Many such techniques exist, each one of them having…
HyperNP: Interactive Visual Exploration of Multidimensional Projection Hyperparameters
Gabriel Appleby, Mateus Espadoto, Rui Chen +4
Projection algorithms such as t-SNE or UMAP are useful for the visualization of high dimensional data, but depend on hyperparameters which must be tuned carefully. Unfortunately, i…
Decoupling Judgment and Decision Making: A Tale of Two Tails
BaÅak Oral, Pierre Dragicevic, Alexandru Telea +1
Is it true that if citizens understand hurricane probabilities, they will make more rational decisions for evacuation? Finding answers to such questions is not straightforward in t…
Supporting Optimal Phase Space Reconstructions Using Neural Network Architecture for Time Series Modeling
Lucas Pagliosa, Alexandru Telea, Rodrigo Mello
The reconstruction of phase spaces is an essential step to analyze time series according to Dynamical System concepts. A regression performed on such spaces unveils the relationshi…
Quantitative Comparison of Time-Dependent Treemaps
Eduardo Vernier, Max Sondag, Joao Comba +3
Rectangular treemaps are often the method of choice to visualize large hierarchical datasets. Nowadays such datasets are available over time, hence there is a need for (a) treemaps…