Location
Havener Center, Miner Lounge / Wiese Atrium, 1:30pm-3:30pm
Start Date
4-2-2026 1:30 PM
End Date
4-2-2026 3:30 PM
Presentation Date
April 2, 2026; 1:30pm-3:30pm
Description
File browsing in the consumer sphere has seen very little advancement in recent years, although attempts have been made to improve upon it. With the goal of multi-level visual file browsing in mind, we present a prototype GridTree, a dynamic, recursive, stable, spatial layout data structure based on subdividing grids, represented as a hierarchy of maps whose granularity increases with depth. We motivate this work with characteristics we have identified as important for viability of a multi-level file-browser, which have become our design goals. We touch on the underlying logic of a GridTree and identify its complexity. We briefly discuss our findings.
Biography
Nathan Tibbetts is a Computer Science Ph.D. student at Missouri S&T studying file system visualization, and is a Kummer Innovation and Entrepreneurship Doctoral Fellow. He received his Bachelor's degree from Brigham Young University (BYU), in the Applied and Computational Mathematics Emphasis (ACME) program, where he learned a love for research. Now, his research topics of interest include, of note, visualizing file systems and creating interactive operating system tools, collaborative technologies, and mesh peer-to-peer file sharing. He has been an intern at FamilySearch, taught both middle school math and Sunday school, and loves reading, gaming, his faith, and spending time with his family.
Meeting Name
2026 - Miners Solving for Tomorrow Research Conference
Department(s)
Computer Science
Document Type
Poster
Document Version
Final Version
File Type
event
Language(s)
English
Rights
© 2026 The Authors, All rights reserved
Included in
Introducing GridTrees for Streaming, Scalable Hierarchical Data Visualization
Havener Center, Miner Lounge / Wiese Atrium, 1:30pm-3:30pm
File browsing in the consumer sphere has seen very little advancement in recent years, although attempts have been made to improve upon it. With the goal of multi-level visual file browsing in mind, we present a prototype GridTree, a dynamic, recursive, stable, spatial layout data structure based on subdividing grids, represented as a hierarchy of maps whose granularity increases with depth. We motivate this work with characteristics we have identified as important for viability of a multi-level file-browser, which have become our design goals. We touch on the underlying logic of a GridTree and identify its complexity. We briefly discuss our findings.
Comments
Advisor: Satish Puri, satish.puri@mst.edu