Optimization for Large-Scale n-ary Family Tree Visualization

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

The family tree is one of the key elements of humanities classics research and is very important for accurately understanding people or families. In this paper, we introduce a method for automatically generating a family tree using information on interpersonal relationships (IIPR) from the Korean Classics Database (KCDB) and visualize interpersonal searches within a family tree using data-driven document JavaScript (d3.js). To date, researchers of humanities classics have wasted considerable time manually drawing family trees to understand people’s influence relationships. An automatic family tree builder analyzes a database that visually expresses the desired family tree. Because a family tree contains a large amount of data, we analyze the performance and bottlenecks according to the amount of data for visualization and propose an optimal way to construct a family tree. To this end, we create an n-ary tree with fake data, visualize it, and analyze its performance using simulation results

Cite

CITATION STYLE

APA

Min, K., Cho, J., Jung, M., & Lee, H. (2023). Optimization for Large-Scale n-ary Family Tree Visualization. Journal of Information and Communication Convergence Engineering, 21(1), 54–61. https://doi.org/10.56977/jicce.2023.21.1.54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free