Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!csd4.milw.wisc.edu!lll-winken!uunet!mcvax!unido!infko!berling
From: berling@infko.UUCP (Roland Berling)
Newsgroups: comp.graphics
Subject: need info on computational geometry
Keywords: polygon, triangulation
Message-ID: <512@infko.UUCP>
Date: 13 Apr 89 08:26:15 GMT
Organization: University of Koblenz (EWH), West Germany
Lines: 21


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