Universal trapezoidation algorithm for planar polygons

Computers and Graphics (Pergamon)

Volumn 23, Issue 3, 1999, Pages 353-363

  Žalik, Borut ^a   Clapworthy, Gordon J ^b  

^a UNIVERSITY OF MARIBOR   (Slovenia)

^b DE MONTFORT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; IMAGE SEGMENTATION;

UNIVERSAL TRAPEZOIDATION ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0032649061     PISSN: 00978493     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0097-8493(99)00044-8     Document Type: Article

References (9)

1. Etzion M., Rappoport A. On compatible start decompositions of simple polygons. IEEE Transactions on Visualization and Computer Graphics. 3:1997;87-95.
2. Chazelle B., Incerpi J. Triangulation and shape complexity. ACM Transactions on Graphics. 3:1984;135-152.
3. Fournier A., Montuno D.Y. Triangulating simple polygons and equivalent problems. ACM Transactions on Graphics. 3:1984;153-174.
4. Seidel R. A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons. Computational Geometry. Theory and Applications 1:1991;51-64.
5. Narkhede A., Manocha D. Fast polygon triangulation based on Seidel's algorithm. Paeth A.W. Graphics gems V. 1995;394-397 Academic Press, Boston.
6. Preparata F.P., Shamos M.I. Computational Geometry. An Introduction:1985;Springer, Berlin.
7. Manber U. Introduction to algorithms. a creative approach:1989;Addison-Wesley, Reading, MA.
8. Mortenson M.E. Geometric modeling. 1985;Wiley, New York.
9. O'Rourke J. Computational Geometry in C. 1993;Cambridge University Press, Cambridge.