The 8th Canadian conference on computational geometry had an international flavour. Sixty-one papers were submitted by authors from over 20 countries representing four continents. The conference was held at Carleton University in August 1996.While this gives an O(na#39;Haquot;) algorithm, our intuition is that in practice it would be much more efficient. The set of lines passing through ... Now consider the (I: + 1)( d - k) + 1 dimensional cross-product Y x R12 A point 3], : in this space represents a k-flat in Ra and ... Each disk c, is the intersection in g of an infinite family H 95 C H of (d a k)-dimensional half-flats. each ha, a of the form al$k+1 + . Had-kid - 5 Zanbsp;...
|Title||:||Canadian Conference on Computational Geometry|
|Publisher||:||McGill-Queen's Press - MQUP - 1996-08-15|