In this paper, we define the straight segment approximation problem (SSAP) for a given digital arc as that of locating a minimum subset of vertices on the arc such that they form a connected sequence of digital straight segments. Sharaiha (Ph.D. thesis, Imperial College, London, 1991) introduced the
✦ LIBER ✦
An algorithm for segment approximation
✍ Scribed by G. Nürnberger; M. Sommer; H. Strauß
- Publisher
- Springer-Verlag
- Year
- 1986
- Tongue
- English
- Weight
- 553 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An Optimal Algorithm for the Straight Se
✍
Y.M. Sharaiha; N. Christofides
📂
Article
📅
1993
🏛
Elsevier Science
⚖ 842 KB
An algorithm for rapid image segmenting
✍
V. Sinkewitsch; F. K. Browand
📂
Article
📅
1993
🏛
Springer
🌐
English
⚖ 270 KB
As a first step in image processing applications it is often required to identify pixels above a threshold intensity level which contact one another. Sorting marker particles when the particle images cover many pixels is an obvious fluid mechanical application. With the present procedure, the image
An algorithm for segment-dragging and it
✍
Bernard Chazelle
📂
Article
📅
1988
🏛
Springer
🌐
English
⚖ 799 KB
An algorithm for approximation of functi
✍
R Chattopadhyay
📂
Article
📅
1973
🏛
Elsevier Science
🌐
English
⚖ 203 KB
An approximation algorithm for square pa
✍
Rob van Stee
📂
Article
📅
2004
🏛
Elsevier Science
🌐
English
⚖ 185 KB
An almost four-approximation algorithm f
✍
Shiyan Hu
📂
Article
📅
2008
🏛
Springer US
🌐
English
⚖ 369 KB