SIGLEAvailable from British Library Document Supply Centre- DSC:DX178345 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Ayala Vallespí, M. Dolors

Martínez Bayona, Jonàs

Pla García, Núria

Vigo Anglada, Marc

In this work we develop two algorithms to compute the skeleton of a binary 2D image. Both algorithms follow
a geometric approach and work directly with the boundary of the image which is an orthogonal polygon (OP).
One of these algorithms processes the edges of the polygon while the other one uses its vertices. Compared with a
thinning method, the presented algorithms show a good performance. This is a work in progress as our final goal
is to extend the vertex-based algorithm method to 3D in order to compute the surface skeleton of a binary volume.Postprint (published version

Martínez Bayona, Jonás

UPCommons. Portal del coneixement obert de la UPC

Skeleton computation of an image using a geometric approach

In this work we develop two algorithms to compute the skeleton of a binary 2D images. Both algorithms follow a geometric approach and work directly with the boundary of the image wich is an orthogonal polygon (OP). One of these algorithms processes the edges of the polygon while the other uses its vertices. Compared to a thinning method, the presented algorithms show a good performance

UPCommons

Yaghi, A.H

OpenGrey Repository

Static and dynamic brittle fracture

In this work we develop two algorithms to compute the skeleton of a binary 2D images. Both algorithms follow a geometric approach and work directly with the boundary of the image wich is an orthogonal polygon (OP). One of these algorithms processes the edges of the polygon while the other uses its vertices. Compared to a thinning method, the presented algorithms show a good performance.Postprint (published version

In this work we develop two algorithms to compute the skeleton of a binary 2D image. Both algorithms follow

a geometric approach and work directly with the boundary of the image which is an orthogonal polygon (OP).

One of these algorithms processes the edges of the polygon while the other one uses its vertices. Compared with a

thinning method, the presented algorithms show a good performance. This is a work in progress as our final goal

is to extend the vertex-based algorithm method to 3D in order to compute the surface skeleton of a binary volume

Static and dynamic brittle fracture

Abstract

Similar works

Full text

Available Versions

UPCommons. Portal del coneixement obert de la UPC

UPCommons

OpenGrey Repository

UPCommons. Portal del coneixement obert de la UPC

UPCommons