Hajij, MustafaSaid, EyadTodd, RobertRitsos, Panagiotis D. and Xu, Kai2020-09-102020-09-102020978-3-03868-122-9https://doi.org/10.2312/cgvc.20201152https://diglib.eg.org:443/handle/10.2312/cgvc20201152We utilize the PageRank vector to generalize the k-means clustering algorithm to directed and undirected graphs. We demonstrate that PageRank and other centrality measures can be used in our setting to robustly compute centrality of nodes in a given graph. Furthermore, we show how our method can be generalized to metric spaces and apply it to other domains such as point clouds and triangulated meshes.10.2312/cgvc.2020115263-66