Weak convex decomposition by lines-of-sight

Shmuel Asafi, Avi Goren, Daniel Cohen-Or

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)23-31
Number of pages9
JournalComputer Graphics Forum
Issue number5
StatePublished - Aug 2013


Dive into the research topics of 'Weak convex decomposition by lines-of-sight'. Together they form a unique fingerprint.

Cite this