✦ LIBER ✦

On the Complexity of the Union of Fat Convex Objects in the Plane

✍ Scribed by A. Efrat; M. Sharir

Publisher: Springer
Year: 2000
Tongue: English
Weight: 255 KB
Volume: 23
Category: Article
ISSN: 0179-5376
DOI: 10.1007/pl00009494

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Bounds on the Union Complexity

Improved Bounds on the Union Complexity of Fat Objects

✍ Mark de Berg 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 417 KB

On Regular Vertices of the Union of Plan

On Regular Vertices of the Union of Planar Convex Objects

✍ Esther Ezra; János Pach; Micha Sharir 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 613 KB

Strange objects in the complex plane

✍ Michael Widom; David Bensimon; Leo P. Kadanoff; Scott J. Shenker 📂 Article 📅 1983 🏛 Springer 🌐 English ⚖ 430 KB

A Tight Bound on the Number of Geometric

A Tight Bound on the Number of Geometric Permutations of Convex Fat Objects inRd

✍ M. J. Katz; K. R. Varadarajan 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 92 KB

On the Kolmogorov Complexity of Arbitrar

On the Kolmogorov Complexity of Arbitrary Objects

✍ Aaron Shenhar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 795 KB

The notion of Kolmogorov program-size complexity (or algorithmic information) is defined here for arbitrary objects. Using a special form of recursive topological spaces, called partition spaces, we define a recursive topology which uses a level of partition for approximation of arbitrary objects in

On the Complexity of Arrangements of Cir

On the Complexity of Arrangements of Circles in the Plane

✍ N. Alon; H. Last; R. Pinchasi; M. Sharir 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 230 KB