Guaranteed Visibility in Scatterplots with Tolerance.

Area of Science:

• Computer Science
• Data Visualization
• Human-Computer Interaction

Background:

• Data visibility is critical in 2D visualizations but often compromised by overlapping elements in complex datasets.
• Existing layout adjustment algorithms can be computationally intensive and do not scale well for large datasets.

Purpose of the Study:

• To propose GIST, a new layout adjustment algorithm that guarantees node visibility, maximizes node size, and preserves the original layout.
• To develop an efficient algorithm capable of handling large datasets by reducing computational complexity.

Main Methods:

• GIST combines a search for maximum node size without overlaps with a limited movement budget to preserve the original layout.
• It employs a geometric space tolerance for overlap detection, approximating overlaps to ensure visibility after rasterization.
• This approach reduces constraints, improving convergence and scalability for large datasets.

Main Results:

• The GIST algorithm effectively optimizes node visibility (at least 1 pixel) and node size.
• It demonstrates a significant improvement in preserving the original layout compared to existing methods.
• The algorithm shows effectiveness in handling large datasets, outperforming state-of-the-art methods.

Conclusions:

• GIST provides an efficient and effective solution for improving the readability of complex 2D visualizations.
• The tolerance-based overlap approximation is key to achieving scalability and maintaining visualization quality.
• GIST represents a significant advancement in layout adjustment algorithms for large-scale data visualization.