Straightening and Partitioning Shapes

Rosin, Paul L. ORCID: https://orcid.org/0000-0002-4965-3884 2001. Straightening and Partitioning Shapes. Lecture Notes in Computer Science 2059 , pp. 440-450. 10.1007/3-540-45129-3_40

Full text not available from this repository.

Abstract

A method for partitioning shapes is described based on a global convexity measure. Its advantages are that its global nature makes it robust to noise, and apart from the number of partitioning cuts no parameters are required. In order to ensure that the method operates correctly on bent or undulating shapes a process is developed that identifies the underlying bending and removes it, straightening out the shape. Results are shown on a large range of shapes.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Publisher:	Springer
ISSN:	0302-9743
Last Modified:	18 Oct 2022 13:21
URI:	https://orca.cardiff.ac.uk/id/eprint/13604

Actions (repository staff only)

Edit Item