polygon operations

Article View: comp.lang.c++.leda

Article #88

Back to comp.lang.c++.leda Previous Next

#88

From: Michael Muehl
Date: Wed, 20 Sep 1995 10:31

21 lines
1529 bytes

Hi !

Is there anyone with experiences in polygon operations and LEDA?
I have to compute polygon intersection, difference and union and the
major problem is the exact detection of the intersection points. The
LEDA-report 'Implementation of a Sweep Line Algorithm for the Straight
Line Segment Intersection Problem' tells something about a floating
point filter. Do someone use this to compute polygon operations? 

Thank you, Michael

---------------------------------------------------------------
|  Michael Muehl                   Michael Muehl              | 
|  GMD                             An der Linde 27            | 
|  Schloss Birlinghoven            50668 Koeln                |
|  53754 St.Augustin               Germany                    |
|  tel.: +49 2241 14 2549          tel.: +49 221 123413       |
|-------------------------------------------------------------|
|  e-mail: muehl@gmd.de                                       |  
|  http://www.gmd.de/People/Michael.Muehl/                    |
---------------------------------------------------------------

Technical Details

Message-ID: <43oqii$1de@omega.gmd.de>

Path: arc1-ca.pugleaf.net!nntp.gmd.de!newsmaster

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!nntp.gmd.de!newsmaster
From: Michael Muehl <muehl@gmd.de>
Newsgroups: comp.lang.c++.leda
Subject: polygon operations
Date: 20 Sep 1995 10:31:46 GMT
Organization: GMD
Message-ID: <43oqii$1de@omega.gmd.de>
NNTP-Posting-Host: post.gmd.de
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
X-Mailer: Mozilla 1.1N (X11; I; SunOS 5.3 sun4c)
X-URL: news:comp.lang.c++.leda