✦ LIBER ✦

On Levels in Arrangements of Lines, Segments, Planes, and Triangles%

✍ Scribed by P. K. Agarwal; B. Aronov; T. M. Chan; M. Sharir

Publisher: Springer
Year: 1998
Tongue: English
Weight: 215 KB
Volume: 19
Category: Article
ISSN: 0179-5376
DOI: 10.1007/pl00009348

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of triangles in simple arr

On the number of triangles in simple arrangements of pseudolines in the real projective plane

✍ Jean-Pierre Roudneff 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 445 KB

On joints in arrangements of lines in sp

On joints in arrangements of lines in space and related problems

✍ Micha Sharir 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 610 KB

On the cross ratios of points and lines

On the cross ratios of points and lines in Moufang planes

✍ Süleyman Ciftci; Basri Çelik 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 62 KB

Dependence of tracking error characteris

Dependence of tracking error characteristics of in-line-type differential push-pull methods on arrangement error of segmented gratings

✍ Masahisa Shinoda; Kenya Nakai 📂 Article 📅 2011 🏛 Optical Society of Japan 🌐 English ⚖ 1019 KB

On Levels in Arrangements of Curves, II:

On Levels in Arrangements of Curves, II: A Simple Inequality and Its Consequences

✍ Timothy M. Chan 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 174 KB

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=