Using Gale transforms in computational geometry
denote a set of
. A Gale
assigns to each point in
a vector in space
such that the resulting
-tuple of vectors reflects all affinely invariant
. First utilized by Gale in the 1950s, Gale transforms have
been recognized as a powerful tool in combinatorial geometry. This paper
introduces Gale transforms to computational geometry. It offers a direct
algorithm for their construction and sketches applications to convex hull and
visibility problems. An application to scene analysis is worked out in some
Reference: F. Aurenhammer.
Using Gale transforms in computational geometry.
In Proc. Workshop on Computational Geometry CG '88, Lecture
Notes in Computer Science, volume 333, pages 202-216, Wuerzburg, Germany,
1988. Springer Verlag.