๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The broadest three-segment unit arc

โœ Scribed by Chatchawan Panraksa; John E. Wetzel; Wacharin Wichiramala

Book ID
106454335
Publisher
Springer Netherlands
Year
2007
Tongue
English
Weight
266 KB
Volume
55
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Covering n-Segment Unit Arcs Is Not Suff
Covering n-Segment Unit Arcs Is Not Sufficient
โœ Chatchawan Panraksa; John E. Wetzel; Wacharin Wichiramala ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer ๐ŸŒ English โš– 127 KB
An Optimal Algorithm for the Straight Se
An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs
โœ Y.M. Sharaiha; N. Christofides ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science โš– 842 KB

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