𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounded straight-line approximation of digitized planar curves and lines

✍ Scribed by Charles M Williams

Publisher
Elsevier Science
Year
1981
Weight
671 KB
Volume
16
Category
Article
ISSN
0146-664X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Segmentation of Planar Curves into Strai
Segmentation of Planar Curves into Straight-Line Segments and Elliptical Arcs
✍ Wenhua Wan; JosΓ© A. Ventura πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 519 KB

quirement, in addition to the high cost of equipment. Thus, it is important to develop machine vision techniques for This paper presents a procedure for segmenting planar curves, mainly the projected boundary contours of machined automated recognition and inspection of 3-D objects (espeparts, into s

Spline-based recognition of straight lin
Spline-based recognition of straight lines and curves in engineering line drawings: Image Vision Comput. Vol 6 No 4 (1988) pp 262–269
✍ J.P. Bixler; T.W. Layne; J.P. Sanford πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 91 KB

The tools are briefly described and are compared as to their usefulness for aiding the automation of code-conformance checking. Beltramini, L and Motard, R L 'KNOD: a knowledge based approach for process design' Comput. Chem. Eng. Vol 12 No 9/10 (1988) pp 939-958 KNOD is an expert shell (written in

On Dense Bipartite Graphs of Girth Eight
On Dense Bipartite Graphs of Girth Eight and Upper Bounds for Certain Configurations in Planar Point–Line Systems
✍ D de Caen; L.A SzΓ©kely πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 956 KB

In earlier work we showed that if G(m, n) is a bipartite graph with no 4-cycles or 6-cycles, and if m<c 1 n 2 and n<c 2 m 2 , then the number of edges e is O((mn) 2Γ‚3 ). Here we give a more streamlined proof, obtaining some sharp results; for example, if G has minimum degree at least two then e 3 -