𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for deciding the containment of polygons

✍ Scribed by Antonio Hernández Barrera

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
491 KB
Volume
59
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for deciding the ty
Efficient algorithms for deciding the type of growth of products of integer matrices
✍ Raphaël M. Jungers; Vladimir Protasov; Vincent D. Blondel 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 257 KB

For a given finite set of matrices with nonnegative integer entries we study the growth with t of We show how to determine in polynomial time whether this growth is bounded, polynomial, or exponential, and we characterize all possible behaviors.

Geometric algorithms for containment ana
Geometric algorithms for containment analysis of rotational parts
✍ Mukul Karnik; Satyandra K. Gupta; Edward B. Magrab 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 959 KB

This paper describes a system and underlying algorithms to perform geometric containment analysis to determine if a newly designed rotational part can be manufactured from a part in an existing database of rotational parts. Only material removal of the database part is considered in order to obtain

On the Decidability of Propositional Alg
On the Decidability of Propositional Algorithmic Logic
✍ Bogdan S. Chlebus 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 802 KB

ON THE DECIDABILITY OF PROPOSITIONAL ALGORITHMIC LOGIC by BOGDAN S. CHLEBIJS in Warsaw (Po1and)l) 0. Introduction Let PAL be a n abbreviation for propositional algorithmic logic. The investigation of PAL is a continuation of earlier works on algorithmic logic (GRABOWSKI [3], KRECZMAR [5], SALWICKI [