home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!mcsun!corton!babbage!imag!genoud
- From: genoud@imag.fr (Philippe Genoud)
- Newsgroups: comp.graphics
- Subject: Looking for Constrained Delaunay Triangulation program
- Message-ID: <39531@imag.imag.fr>
- Date: 8 Sep 92 12:39:29 GMT
- Sender: usenet@imag.fr
- Reply-To: genoud@imag.fr (Philippe Genoud)
- Organization: IMAG, University of Grenoble, France
- Lines: 23
- Nntp-Posting-Host: pixou
-
- We are looking for a C program implementing Constrained Delaunay Triangulation.
-
- Constrained Delaunay Triangulation is defined as follow :
- "Given a set of n vertice in the plane together with a set of
- noncrossing edges, the cpnstrained Delaunay Traingulation (CDT) is
- the triangulation of the vertices with the following properties :
- (1) the prespecified edges are included in the traingulation,
- (2) it is as close as possible to the Delaunay triangulation."
- in L. Paul Chew ,"Constrained Delaunay Triangulations", Proc. Third
- Symp. on Computational Geometry 1987.
-
- ----------------------------------------------------------
- Philippe GENOUD Fax : (33) 76.63.84.23
- Laboratoire ARTEMIS-IMAG Phone : (33) 76.51.46.04
- BP 53 X Email : genoud@imag.fr
- 38041 GRENOBLE Cedex - FRANCE
- ----------------------------------------------------------
-
- --
- Philippe GENOUD Fax : (33) 76.63.84.23
- Laboratoire ARTEMIS-IMAG Phone : (33) 76.51.46.04
- BP 53 X Email : genoud@pixou.imag.fr
- 38041 GRENOBLE Cedex - FRANCE
-