Shape Partitioning by Convexity | Zendy

Paul L. Rosin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Shape Partitioning by Convexity

Author(s) -

Paul L. Rosin

Publication year - 1999

Publication title -

citeseer x (the pennsylvania state university)

Language(s) - English

Resource type - Conference proceedings

DOI - 10.5244/c.13.63

Subject(s) - convexity , simple (philosophy) , decomposition , shape analysis (program analysis) , computer science , component (thermodynamics) , mathematics , artificial intelligence , mathematical optimization , pattern recognition (psychology) , algorithm , static analysis , financial economics , economics , ecology , philosophy , physics , epistemology , biology , programming language , thermodynamics

The partitioning of 2D shapes into subparts is an important component of shape analysis. This paper defines a formulation of convexity as a criterion of good part decomposition. Its appropriateness is validated by applying it to some simple shapes as well as against showing its close correspondence with Hoffman and Singh’s part saliency factors.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research