Subject: CGAL users discussion list
List archive
- From: "Jannis Warnat" <>
- To: <>
- Subject: [cgal-discuss] Computing a single face in an arrangement
- Date: Mon, 1 Feb 2010 16:09:45 +0100
Dear CGAL contributors,
in the context of my diploma thesis at the
University of Bonn I recently implemented the deterministic algorithm for
computing a single face in an arrangement of line segments (from the book
"Davenport-Schinzel sequences and their geometric applications" by Micha Sharir
and Pankaj K. Agarwal) using CGAL´s arrangement package and its sweep line
framework.
Via the following link you can download the thesis
(in English) and the source code:
http://www.divshare.com/folder/671600-80a (Divshare mangled the file name, please rename redblue_tar.gz
to redblue.tar.gz)
Originally I worked with CGAL 3.4, but the
source code has now been adapted to work with CGAL 3.5.1 and is tested under
Ubuntu Linux 9.10. Just copy the files in redblue.tar.gz into a folder
/CGAL-3.5.1/demo/Red_blue_merge_demo/ and type
cmake .
make
I´d be happy to help in case of any installation
troubles.
Since I very much enjoyed working with CGAL
I would like to thank all its contributors; especially Efi Fogel, Ron
Wein, Baruch Zukerman and Tali Zvi along with all current and past members of
the Applied Computational Geometry Lab at Tel Aviv University for providing
their arrangement package under an open source license.
I am looking forward to any feedback.
Kind regards
Jannis Warnat
|
- [cgal-discuss] Computing a single face in an arrangement, Jannis Warnat, 02/01/2010
- Re: [cgal-discuss] Computing a single face in an arrangement, Efraim Fogel, 02/02/2010
- Re: [cgal-discuss] Computing a single face in an arrangement, Eric Berberich, 02/02/2010
- Re: [cgal-discuss] Computing a single face in an arrangement, Jannis Warnat, 02/02/2010
- Re: [cgal-discuss] Computing a single face in an arrangement, Efraim Fogel, 02/02/2010
Archive powered by MHonArc 2.6.16.