z-logo
open-access-imgOpen Access
Polygon Evolution by Vertex Deletion
Author(s) -
Longin Jan Latecki,
Rolf Lakämper
Publication year - 1999
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-66498-X
DOI - 10.1007/3-540-48236-9_35
Subject(s) - rounding , vertex (graph theory) , computer science , algorithm , simple (philosophy) , polygon (computer graphics) , theoretical computer science , telecommunications , philosophy , epistemology , frame (networking) , graph , operating system
We propose a simple approach to evolution of polygonal curves that is specially designed to fit discrete nature of curves in digital images. It leads to simplification of shape complexity with no blurring (i.e., shape rounding) effects and no dislocation of relevant features. Moreover, in our approach the problem to determine the size of discrete steps for numerical implementations does not occur, since our evolution method leads in a natural way to a finite number of discrete evolution steps which are just the iterations of a basic procedure of vertex deletion.

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom