✦ LIBER ✦

Intersection of planar curves and straight lines

✍ Scribed by Togo Nishiura; Daniel Waterman

Publisher: Springer Vienna
Year: 1963
Tongue: English
Weight: 189 KB
Volume: 67
Category: Article
ISSN: 0026-9255
DOI: 10.1007/bf01298940

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounded straight-line approximation of d

Bounded straight-line approximation of digitized planar curves and lines

✍ Charles M Williams 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 671 KB

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

Intersections of planar convex curves

✍ P. R. Goodey 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 582 KB

Parallel, overlapped, and intersected di

Parallel, overlapped, and intersected digital straight lines

✍ Son Pham 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 954 KB

Numerical characteristics of systems of

Numerical characteristics of systems of straight lines on complete intersections

✍ A. S. Libgober 📂 Article 📅 1973 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 308 KB

On the intersection of edges of a geomet

On the intersection of edges of a geometric graph by straight lines

✍ N. Alon; M.A. Perles 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 969 KB

A geometric graph ( = gg) is a pair G = (V, E), where V is a finite set of points ( = vertices) in general position in the plane, and E is a set of open straight line segments ( = edges) whose endpoints are in V. G is a convex gg ( = egg) if V is the set of vertices of a convex polygon. For n 3 1, 0