Steven van den Broek, Wouter Meulemans, Bettina Speckmann
{"title":"SimpleSets: Capturing Categorical Point Patterns with Simple Shapes","authors":"Steven van den Broek, Wouter Meulemans, Bettina Speckmann","doi":"arxiv-2407.14433","DOIUrl":null,"url":null,"abstract":"Points of interest on a map such as restaurants, hotels, or subway stations,\ngive rise to categorical point data: data that have a fixed location and one or\nmore categorical attributes. Consequently, recent years have seen various set\nvisualization approaches that visually connect points of the same category to\nsupport users in understanding the spatial distribution of categories. Existing\nmethods use complex and often highly irregular shapes to connect points of the\nsame category, leading to high cognitive load for the user. In this paper we\nintroduce SimpleSets, which uses simple shapes to enclose categorical point\npatterns, thereby providing a clean overview of the data distribution.\nSimpleSets is designed to visualize sets of points with a single categorical\nattribute; as a result, the point patterns enclosed by SimpleSets form a\npartition of the data. We give formal definitions of point patterns that\ncorrespond to simple shapes and describe an algorithm that partitions\ncategorical points into few such patterns. Our second contribution is a\nrendering algorithm that transforms a given partition into a clean set of\nshapes resulting in an aesthetically pleasing set visualization. Our algorithm\npays particular attention to resolving intersections between nearby shapes in a\nconsistent manner. We compare SimpleSets to the state-of-the-art set\nvisualizations using standard datasets from the literature.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"56 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.14433","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Points of interest on a map such as restaurants, hotels, or subway stations,
give rise to categorical point data: data that have a fixed location and one or
more categorical attributes. Consequently, recent years have seen various set
visualization approaches that visually connect points of the same category to
support users in understanding the spatial distribution of categories. Existing
methods use complex and often highly irregular shapes to connect points of the
same category, leading to high cognitive load for the user. In this paper we
introduce SimpleSets, which uses simple shapes to enclose categorical point
patterns, thereby providing a clean overview of the data distribution.
SimpleSets is designed to visualize sets of points with a single categorical
attribute; as a result, the point patterns enclosed by SimpleSets form a
partition of the data. We give formal definitions of point patterns that
correspond to simple shapes and describe an algorithm that partitions
categorical points into few such patterns. Our second contribution is a
rendering algorithm that transforms a given partition into a clean set of
shapes resulting in an aesthetically pleasing set visualization. Our algorithm
pays particular attention to resolving intersections between nearby shapes in a
consistent manner. We compare SimpleSets to the state-of-the-art set
visualizations using standard datasets from the literature.