𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using Gale transforms in computational geometry

✍ Scribed by Franz Aurenhammer

Publisher
Springer-Verlag
Year
1991
Tongue
English
Weight
636 KB
Volume
52
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Projective Geometry of the Gale Tran
The Projective Geometry of the Gale Transform
✍ David Eisenbud; Sorin Popescu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 297 KB

The Gale transform, an involution on sets of points in projective space, appears in a multitude of guises and in subjects as diverse as optimization, coding theory, theta functions, and recently in our proof that certain general sets of points fail to Ε½ satisfy the minimal free resolution conjecture

Derandomization in Computational Geometr
Derandomization in Computational Geometry
✍ JiΕ™Δ±́ MatouΕ‘ek πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 306 KB

We survey techniques for replacing randomized algorithms in computational geometry by deterministic ones with a similar asymptotic running time.

Integral transforms as computational too
Integral transforms as computational tools in quantum mechanics
✍ G. Paiano; D. Picca πŸ“‚ Article πŸ“… 1975 πŸ› Elsevier Science 🌐 English βš– 537 KB

It is shown how integral transforms can be powerful computational tools even in quantum mechanics, a field where they are not usually applied.

Constructions in Finite Geometry Using C
Constructions in Finite Geometry Using Computer Algebra Systems
✍ G.L. Ebert πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 271 KB

One way of using a computer algebra system to do research in finite geometry is to use the system to construct "small" order examples of various constructions, and then hope to recognize a pattern that can be generalized and eventually proven. Of course, initially one does not know if the "small" or