Weak Convex Decomposition by Lines-of-sight
Loading...
Date
2013
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing Ltd.
Abstract
We define the convexity rank of a set of points to be the portion of mutually visible pairs of points out of the total number of pairs. Based on this definition of weak convexity, we introduce a spectral method that decomposes a given shape into weakly convex regions. The decomposition is applied without explicitly measuring the convexity rank. The method merely amounts to a spectral clustering of a matrix representing the all-pairs line of sight. Our method can be directly applied on an oriented point cloud and does not require any topological information, nor explicit concavity or convexity measures. We demonstrate the efficiency of our algorithm on a large number of examples and compare them qualitatively with competitive approaches.
Description
@article{10.1111:cgf.12169,
journal = {Computer Graphics Forum},
title = {{Weak Convex Decomposition by Lines-of-sight}},
author = {Asafi, Shmuel and Goren, Avi and Cohen-Or, Daniel},
year = {2013},
publisher = {The Eurographics Association and Blackwell Publishing Ltd.},
ISSN = {1467-8659},
DOI = {10.1111/cgf.12169}
}