dc.contributor.author | Kurlin, Vitaliy | en_US |
dc.contributor.editor | Mirela Ben-Chen and Ligang Liu | en_US |
dc.date.accessioned | 2015-07-06T05:01:17Z | |
dc.date.available | 2015-07-06T05:01:17Z | |
dc.date.issued | 2015 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1111/cgf.12713 | en_US |
dc.description.abstract | Real data are often given as a noisy unstructured point cloud, which is hard to visualize. The important problem is to represent topological structures hidden in a cloud by using skeletons with cycles. All past skeletonization methods require extra parameters such as a scale or a noise bound. We define a homologically persistent skeleton, which depends only on a cloud of points and contains optimal subgraphs representing 1-dimensional cycles in the cloud across all scales. The full skeleton is a universal structure encoding topological persistence of cycles directly on the cloud. Hence a 1-dimensional shape of a cloud can be now easily predicted by visualizing our skeleton instead of guessing a scale for the original unstructured cloud. We derive more subgraphs to reconstruct provably close approximations to an unknown graph given only by a noisy sample in any metric space. For a cloud of n points in the plane, the full skeleton and all its important subgraphs can be computed in time O(n log n). | en_US |
dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.subject | I.5.1 [Pattern Recognition] | en_US |
dc.subject | Models | en_US |
dc.subject | Structural | en_US |
dc.title | A One-dimensional Homologically Persistent Skeleton of an Unstructured Point Cloud in any Metric Space | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.sectionheaders | Curves and Graphs | en_US |
dc.description.volume | 34 | en_US |
dc.description.number | 5 | en_US |
dc.identifier.doi | 10.1111/cgf.12713 | en_US |
dc.identifier.pages | 253-262 | en_US |