APVIS 2005
Asia Pacific Symposium on Information Visualisation 2005
January 27 – 29, 2005, Sydney, Australia
Accepted Paper List
Kazuyuki MIURA and Takao NISHIZEKI
“Rectangle-of-Influence Drawings of Four-connected Plane Graphs”
Ying Xin (Christine) WU and Masahiro TAKATSUKA
“The three dimensional colour pickers”
Xiaobin (Robert) SHEN and Peter EADES
“Using Money Colour to Represent Financial Data”
Julien EPPS and Alianthamby AMBIKAIRAJAH
“Visualisation of Reduced-Dimension Microarray Data Using GMMs”
Clare CHURCHER, Paul RUTHERFORD and John MCCALLUM
“An Interactive Visualisation for Selection Genetic Primers”
Neville CHURCHER and Warwick IRWIN
“Informing the Design of Pipeline-based Software Visualisations”
Weidong (Tony) HUANG and Peter EADES
“How people read Graphs”
Kozo SUGIYAMA, Ryo OOSAWA and Seok-Hee HONG
“The Puzzle Generators and Symmetric Puzzle Layout”
Hiroshi HOSOBE
“An Extended High-Dimensional Method for Interactive Graph Drawing”
Colin MURRAY
“A User-based Evaluation of Skeletal Animation Techniques in Graph Interaction”
Wanchun (Paul) LI, Peter EADES and Nikola NIKOLOV
“Using Spring Algorithms to Remove Node Overlapping”
Li LIN, Longbing CAO and Chengqi ZHANG
“The Fish-Eye Visualisation of Foreign Currency Exchange Data Streams”
Christopher MADDEN, Ben YIP, Shea GOYETTE
“Visualising Internet Traffic Data with Three-Dimensional Spherical Display”
Keith NESBITT
“Using Guidelines to assist in the Visualisation Design Process”
Adel AHMED and Peter EADES
“Automatic Camera Path Generation for Graph Navigation in 3D”
Seokhee HONG and Nikola S NIKOLOV
“Layered Drawings of Directed Graphs in Three Dimensions”
Xiaoyan FU and Dahai LI
“Haptic Shoes: Representing Information By Vibration”
Tim DWYER
“Extending the WilmaScope 3D Graph Visualisation System – Software Demonstration”
Bruce THOMAS and Andrew CUNNINGHAM
“Target Motion Analysis Visualisation”
Colin MURRAY and Carsten Friedrich
“Visualisation of Satisfiability using the Logic Engine”
Lanbo ZHENG, Le SONG and Peter EADES
“Crossing Minimisation problems of drawing bipartite graphs in two clusters”