๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An optimal algorithm for finding minimal enclosing triangles

โœ Scribed by Joseph O'Rourke; Alok Aggarwal; Sanjeev Maddila; Michael Baldwin

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
615 KB
Volume
7
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An optimal algorithm for finding an encl
An optimal algorithm for finding an enclosing planar rectilinear annulus of minimum width
โœ Olga N. Gluchshenko; Horst W. Hamacher; Arie Tamir ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 807 KB

Given a set P of n points in the plane, we consider the problem of finding a planar rectilinear annulus of minimum width which encloses the set P. We present an optimal O(n log n) algorithm for this problem.

An optimal parallel algorithm for genera
An optimal parallel algorithm for generating permutations in minimal change order
โœ Jong-Chuang Tsay; Wei-Ping Lee ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 430 KB

Permutation generation is an important problem in combinatorial computing. In this paper we present an optimal parallel algorithm to generate all N! permutations of N objects. The algorithm is designed to be executed on a very simple computation model that is a linear array with N identical processo

Algorithm for finding minimal cut sets i
Algorithm for finding minimal cut sets in a fault tree
โœ Ladislav Rosenberg ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorit