𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the shortest diagonal of a monotone polygon in linear time

✍ Scribed by Binhai Zhu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
398 KB
Volume
42
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimally Computing the Shortest Weakly
Optimally Computing the Shortest Weakly Visible Subedge of a Simple Polygon
✍ Danny Z. Chen πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 209 KB

Given an n-vertex simple polygon P, the problem of computing the shortest weakly visible subedge of P is that of finding a shortest line segment s on the Ε½ . boundary of P such that P is weakly visible from s if s exists . In this paper, we present new geometric observations that are useful for solv

A computational method for finding the z
A computational method for finding the zeros of a multivariable linear time invariant system
✍ E.J. Davison πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 299 KB

calculating the zeros of the transfer function which exists between an input and output of an arbitrary multivariable linear time invariant systemβ€’ The method is simple to use; is computationally fast and is accurate. Some numerical examples for a 9th order system are included.

A fast algorithm for the computation of
A fast algorithm for the computation of the plasma concentration time curve and confidence limits in linear pharmacokinetics
✍ P.J.A. Lago πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 531 KB

An algorithm is developed for the computation of the plasma concentration time curve for a drug administration regime involving fast injection (bolus) and/or continuous infusion. The effect of the pharmacokinetic model parameter variations on the plasma concentration time curve is analyzed and effic