NCP: Neighborhood-Preserving Non-Uniform Circle Packing for Visualization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915766675177472 |
|---|---|
| author | Li, Duan Yuan, Jun Guo, Xinyuan Wang, Xiting Liu, Yang Yang, Weikai Liu, Shixia |
| author_facet | Li, Duan Yuan, Jun Guo, Xinyuan Wang, Xiting Liu, Yang Yang, Weikai Liu, Shixia |
| contents | Circle packing is widely used in visualization due to its aesthetic appeal and simplicity, particularly in tasks where the spatial arrangement and relationships between data are of interest, such as understanding proximity relationships (e.g., images with categories) or analyzing quantitative data (e.g., housing prices). Many applications require preserving neighborhood relationships while encoding a quantitative attribute using radii for data analysis. To meet these two requirements simultaneously, we present a neighborhood-preserving non-uniform circle packing method, NCP. This method preserves neighborhood relationships between the data represented by non-uniform circles to comprehensively analyze similar data and an attribute of interest. We formulate neighborhood-preserving non-uniform circle packing as a planar graph embedding problem based on the circle packing theorem. This formulation leads to a non-convex optimization problem, which can be solved by the continuation method. We conduct a quantitative evaluation and present two use cases to demonstrate that our NCP method can effectively generate non-uniform circle packing results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_00668 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | NCP: Neighborhood-Preserving Non-Uniform Circle Packing for Visualization Li, Duan Yuan, Jun Guo, Xinyuan Wang, Xiting Liu, Yang Yang, Weikai Liu, Shixia Human-Computer Interaction Circle packing is widely used in visualization due to its aesthetic appeal and simplicity, particularly in tasks where the spatial arrangement and relationships between data are of interest, such as understanding proximity relationships (e.g., images with categories) or analyzing quantitative data (e.g., housing prices). Many applications require preserving neighborhood relationships while encoding a quantitative attribute using radii for data analysis. To meet these two requirements simultaneously, we present a neighborhood-preserving non-uniform circle packing method, NCP. This method preserves neighborhood relationships between the data represented by non-uniform circles to comprehensively analyze similar data and an attribute of interest. We formulate neighborhood-preserving non-uniform circle packing as a planar graph embedding problem based on the circle packing theorem. This formulation leads to a non-convex optimization problem, which can be solved by the continuation method. We conduct a quantitative evaluation and present two use cases to demonstrate that our NCP method can effectively generate non-uniform circle packing results. |
| title | NCP: Neighborhood-Preserving Non-Uniform Circle Packing for Visualization |
| topic | Human-Computer Interaction |
| url | https://arxiv.org/abs/2602.00668 |