✦ LIBER ✦

Vehicle path specification by a sequence of straight lines

✍ Scribed by Kanayama, Y.; Yuta, S.

Book ID: 114561771
Publisher: IEEE
Year: 1988
Tongue: English
Weight: 967 KB
Volume: 4
Category: Article
ISSN: 0882-4967
DOI: 10.1109/56.787

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedded minimal annuli inR3bounded by a

Embedded minimal annuli inR3bounded by a pair of straight lines

✍ David Hoffman; Hermann Karcher; Harold Rosenberg 📂 Article 📅 1991 🏛 European Mathematical Society 🌐 English ⚖ 884 KB

Chebyshev approximation of a point set b

Chebyshev approximation of a point set by a straight line

✍ M. Streng; W. Wetterling 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 469 KB

The probability of a straight-line seque

The probability of a straight-line sequence from a uniform independent sample source (Corresp.)

✍ Lynch, T. 📂 Article 📅 1968 🏛 IEEE 🌐 English ⚖ 182 KB

Solution of Chaplygin's equation by the

Solution of Chaplygin's equation by the method of straight lines

✍ I. Biibosunov; A. Ryskulov 📂 Article 📅 1974 🏛 Springer 🌐 English ⚖ 400 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

Approximation of irregular polylines by

Approximation of irregular polylines by means of a straight-line graph

✍ Mariarosaria Rizzardi; Salvatore Troisi 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 657 KB