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 addresses applications to convex hull
and visibility problems. An application to scene analysis is worked out in
Reference: F. Aurenhammer.
Using Gale transforms in computational geometry.
Mathematical Programming, B 52:179-190, 1991.
Special Issue. [IIG-Report-Series 248, TU Graz, Austria, 1988].