An Efficient Simplex Coverability Algorithm in E2 with Application to Stochastic Sequential Machines

The problem of determining the existence of a simplex which covers a given convex polytope inside another given convex polytope in two-dimensional Euclidean space is shown to be efficiently solvable, and an effective procedure is derived to find a suitable covering simplex or show that none exists....

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on computers Vol. C-28; no. 2; pp. 109 - 120
Main Author:	Silio
Format:	Journal Article
Language:	English
Published:	IEEE 01.02.1979
Subjects:	Complexity theory Computational complexity Computational efficiency Computer architecture Computers convex polytopes covering problems finite search procedure geometric programming High level languages Indexes Mathematical models probabilistic automata Search problems Silicon simplex covering Testing
ISSN:	0018-9340, 1557-9956
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!