Steven Halim, Roland H. C. Yap, Hoong Chuin Lau
2006 Proceedings of the 19th annual ACM symposium on User interface software and technology - UIST '06  
N P-hard combinatorial optimization problems are common in real life. Due to their intractability, local search algorithms are often used to solve such problems. Since these algorithms are heuristic-based, it is hard to understand how to improve or tune them. We propose an interactive visualization tool, VIZ, meant for understanding the behavior of local search. VIZ uses animation of abstract search trajectories with other visualizations which are also animated in a VCR-like fashion to
more » ... fashion to graphically playback the algorithm behavior. It combines generic visualizations applicable on arbitrary algorithms with algorithm and problem specific visualizations. We use a variety of techniques such as alpha blending to reduce visual clutter and to smooth animation, highlights and shading, automatically generated index points for playback, and visual comparison of two algorithms. The use of multiple viewpoints can be an effective way of understanding search behavior and highlight algorithm behavior which might otherwise be hidden.
doi:10.1145/1166253.1166264 dblp:conf/uist/HalimYL06 fatcat:gng44hbtpbafdiewnchwvkpcga