Efficient triangulation of simple polygons
This paper considers the topic of efficiently traingulating a simple polygon with emphasis on practical and easy-to-implement algorithms. It also describes a new adaptive algorithm for triangulating a simple n-sided polygon. The algorithm runs in time O(n(1+ t o)) with t0< n. The quantity t0 meas...
|Published in:||The visual computer : international journal of computer graphics, Vol. 7, No. 5/6 (1991), p. 280-295|
|QR Code:||Show QR Code|