polygon operations

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

2 messages

[T] Back to Threads [V] Tree View [G] Group Articles

2 total messages Started by Michael Muehl Wed, 20 Sep 1995 10:31

#88

Author: 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/                    |
---------------------------------------------------------------

Re: polygon operations

#89

Author: Christian Uhrig
Date: Thu, 21 Sep 1995 08:37

11 lines
631 bytes

Hi,

the operations intersection and union are provided by the polygon type of the
current distribution (R-3.2.3 and also R-3.2.2).

see P.intersection(const polygon& Q) and
    P.unite(const polygon& Q)

Best,

Christian

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads