𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The On-Line Heilbronn's Triangle Problem in d Dimensions

✍ Scribed by Gill Barequet; Alina Shaikhet

Publisher
Springer
Year
2007
Tongue
English
Weight
194 KB
Volume
38
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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=

On the no-three-in-line problem
On the no-three-in-line problem
✍ D Craggs; R Hughes-Jones πŸ“‚ Article πŸ“… 1976 πŸ› Elsevier Science 🌐 English βš– 61 KB