Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Geometrical parameters extraction from discrete paths
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Minimum-Length Polygons in Simple Cube-Curves
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Ridgelet Transform Based on Reveillès Discrete Lines
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
DGCI '02 Proceedings of the 10th International Conference on Discrete Geometry for Computer Imagery
Digital Straight Line Segments
IEEE Transactions on Computers
Supercover model and digital straight line recognition on irregular isothetic grids
DGCI'05 Proceedings of the 12th international conference on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
All the polygonalisation algorithms we can find in the literature proceed on 4-connected or 8-connected discrete arcs. In this article, we aim to polygonalise “thick arcs”. A first step consists in giving a definition of such arcs based on morphological properties. In a second step, we propose two methods in order to polygonalise such arcs. The first one is based on a squelettisation of the arc and uses the fuzzy arc polygonalisation. The second one is based on a grouping of the cells in order to obtain heterogeneous pixels and then, the polygonalisation of heterogeneous arcs is applied.