𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time construction of the relative neighborhood graph from the Delaunay triangulation

✍ Scribed by Andrzej Lingas

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
649 KB
Volume
4
Category
Article
ISSN
0925-7721

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Classification of Linear Time-Optimal
A Classification of Linear Time-Optimal Control Problems in a Neighborhood of the Origin
✍ G.M. Sklyar; S.Yu. Ignatovich πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 236 KB

The main goal of the paper is to classify time-optimal control problems for linear controllable systems with analytic coefficients. The reduction to the Markov moment min-problem is the main tool of this investigation. The constructive solution of the time-optimal control problem using mentioned red

On the construction of an inverse for a
On the construction of an inverse for a linear time-invariant system
✍ K.B. Datta πŸ“‚ Article πŸ“… 1984 πŸ› Elsevier Science 🌐 English βš– 471 KB

The inversion of linear time-invariant systems is studied here on the basis of the matrix-fraction description (MFD) of linear systems and Fuhrmann's module\*theoretic approach of realizing them. It has been shown that the states reached at time f = 1 starting from a zero initial state construct the

A linear-time algorithm for computing th
A linear-time algorithm for computing the intersection of all odd cycles in a graph
✍ Leizhen Cai; Baruch Schieber πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.