𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions

✍ Scribed by Marc Glisse; Sylvain Lazard

Book ID
113044313
Publisher
Springer
Year
2012
Tongue
English
Weight
742 KB
Volume
47
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On hausdorff and topological dimensions
On hausdorff and topological dimensions of the kolmogorov complexity of the real line
✍ Jin-yi Cai; Juris Hartmanis πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 767 KB

We investigate the Kolmogorov complexity of real numbers. Let K be the Kolmogorov complexity function; we determine the Hausdorff dimension and the topological dimension of the graph of K. Since these dimensions are different, the graph of the Kolmogorov complexity function of the real line forms a

On-line construction of the upper envelo
On-line construction of the upper envelope of triangles and surface patches in three dimensions
✍ Jean-Daniel Boissonnat; Katrin T.G. Dobrindt πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 984 KB

In this paper, we describe a randomized incremental algorithm for computing the upper envelope (i.e., the pointwise maximum) of a set of n triangles in three dimensions. This algorithm is an on-line algorithm. It is structure-sensitive: the expected cost of inserting the n-th triangle is O(log nErO=