✦ LIBER ✦

Boolean operations based on the planar polyhedral representation

✍ Scribed by J. Flaquer; J.L. Rodil

Book ID: 116090097
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 343 KB
Volume: 12
Category: Article
ISSN: 0097-8493
DOI: 10.1016/0097-8493(88)90008-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Boolean operations based on the planar p

Boolean operations based on the planar polyhedral representation: Comput. & Graph. Vol 12 No 1 (1988) pp 59–64

✍ J. Flaquer; J.L. Rodil 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 110 KB

Boolean operations on general planar pol

Boolean operations on general planar polygons

✍ M. Rivero; F.R. Feito 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 780 KB

Boolean set operations on non-manifold b

Boolean set operations on non-manifold boundary representation objects

✍ E.Levent Gursoz; Young Choi; Friedrich B. Prinz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 829 KB

Boolean set operations on non-manifold b

Boolean set operations on non-manifold boundary representation objects

✍ E.Levent Gursoz; Young Choi; Friedrich B. Prinz 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 829 KB

On representation and approximation of o

On representation and approximation of operations in Boolean algebras

✍ I. R. Goodman; Vladik Kreinovich 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB 👁 1 views

Several universal approximation and universal representation results are known for non-Boolean multivalued logics such as fuzzy logics. In this paper, we show that similar results can be proven for multivalued Boolean logics as well.

A topologically robust algorithm for Boo

A topologically robust algorithm for Boolean operations on polyhedral shapes using approximate arithmetic

✍ J.M. Smith; N.A. Dodgson 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 906 KB

We present a topologically robust algorithm for Boolean operations on polyhedral boundary models. The algorithm can be proved always to generate a result with valid connectivity if the input shape representations have valid connectivity, irrespective of the type of arithmetic used or the extent of n