✦ LIBER ✦

Algorithm for Finding the Domain Intersection of a Set of Polytopes

✍ Scribed by Tereshchenko, Vasyl; Chevokin, Sergii; Fisunenko, Andriy

Book ID: 122710112
Publisher: Elsevier
Year: 2013
Tongue: English
Weight: 163 KB
Volume: 18
Category: Article
ISSN: 1877-0509
DOI: 10.1016/j.procs.2013.05.209

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A compact algorithm for the intersection

A compact algorithm for the intersection and approximation of N-dimensional polytopes

✍ V. Broman; M.J. Shensa 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 885 KB

In a very general sense, estimation problems are concerned with relating measurements to a (hopefully small) region containing the unknown state or parameters. Polytopes present a natural candidate for the representation and manipulation of such regions. In fact, assuming the existence of a suitable

A unified algorithm for finding the inte

A unified algorithm for finding the intersection curve of surfaces

✍ Jianrong Tan; Jianmin Zheng; Qunsheng Peng 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 466 KB

A separation algorithm for the matchable

A separation algorithm for the matchable set polytope

✍ William H. Cunningham; Jan Green-Krótki 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 820 KB

An Algorithm for Solving the Minimum-Nor

An Algorithm for Solving the Minimum-Norm Point Problem over the Intersection of a Polytope and an Affine Set

✍ S. Fujishige; X. Liu; X. Zhang 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 198 KB

A new optimal distributed algorithm for

A new optimal distributed algorithm for the set intersection problem

✍ Subbiah Rajanarayanan; Sitharama S. Iyengar 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Heuristic algorithm for finding the maxi

Heuristic algorithm for finding the maximum independent set

✍ A. D. Plotnikov 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 157 KB