Abstract
Visualization of 2D point clouds is one of the most basic yet one of the most important problems in many visual data analysis tasks. Point clouds arise in many contexts including scatter plot analysis, or the visualization of high-dimensional or geo-spatial
data. Typical analysis tasks in point cloud data include assessing the overall structure and distribution of the data, assessing spatial relationships between data elements, and identification of clusters and outliers. Standard point-based visualization
methods do not scale well with respect to the data set size. Specifically, as the number of data points and data classes increases, the display quickly gets crowded, making it difficult to effectively analyze the point clouds.
We propose to abstract large sets of point clouds to compact shapes, facilitating the scalability of point cloud visualization with respect to data set size. We introduce a novel algorithm for constructing compact shapes that enclose all members of a given
point cloud, providing good perceptional properties and supporting visual analysis of large data sets of many overlapping point clouds. We apply the algorithm in two different applications, demonstrating the effectiveness of the technique for large point
cloud data. We also present an evaluation of key shape metrics, showing the efficiency of the solution as compared to standard approaches.
data. Typical analysis tasks in point cloud data include assessing the overall structure and distribution of the data, assessing spatial relationships between data elements, and identification of clusters and outliers. Standard point-based visualization
methods do not scale well with respect to the data set size. Specifically, as the number of data points and data classes increases, the display quickly gets crowded, making it difficult to effectively analyze the point clouds.
We propose to abstract large sets of point clouds to compact shapes, facilitating the scalability of point cloud visualization with respect to data set size. We introduce a novel algorithm for constructing compact shapes that enclose all members of a given
point cloud, providing good perceptional properties and supporting visual analysis of large data sets of many overlapping point clouds. We apply the algorithm in two different applications, demonstrating the effectiveness of the technique for large point
cloud data. We also present an evaluation of key shape metrics, showing the efficiency of the solution as compared to standard approaches.
| Original language | English |
|---|---|
| Title of host publication | Full papers - WSCG '2008, The 16-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, University of West Bohemia, Plzen, Czech Republic, February 4 - 7, 2008 |
| Editors | Steve Cunningham |
| Place of Publication | Plzen |
| Publisher | University of West Bohemia |
| Pages | 33-40 |
| ISBN (Print) | 978-80-86943-15-2 |
| Publication status | Published - 2008 |
| Event | 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision: WSCG 2008 - Plzen, Czech Republic Duration: 4 Feb 2008 → 7 Feb 2008 |
Conference
| Conference | 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision |
|---|---|
| Abbreviated title | WSCG 2008 |
| Country/Territory | Czech Republic |
| City | Plzen |
| Period | 4/02/08 → 7/02/08 |
Fields of Expertise
- Sonstiges