[comp.graphics] need info on computational geometry

berling@infko.UUCP (Roland Berling) (04/13/89)

Hello,

I am searching for an algorithm for the triangulation 
of general (convex & concave) polygons bounded by straight 
line segments.

I will thank you, if you have any hints on literature, methods, ...

Please e-mail, I will summarize to the net.

						-rb


Roland Berling, 
Universitaet Koblenz (EWH)
Informatik
Rheinau 3-4 
D-5400 Koblenz  (West Germany)

UUCP: ..mcvax!unido!infko!berling        berling@infko.UUCP