- Next message: Eric Niebler: "Re: [boost] [accumulator] reset?"
- Previous message: Barend Gehrels: "[boost] [geometry] [impl] Concepts"
- In reply to: Simonson, Lucanus J: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
- Next in thread: Phil Endecott: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
- Reply: Phil Endecott: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
- Reply: Simonson, Lucanus J: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
>> Vatti, B.R. "A Generic Solution to Polygon Clipping"; Communications
>> of
>> the ACM, 35(7), July 1992, pp.56-63.
>> As far as I know it is not directly/freely available.
>>
>
> It looks like my algorithm is most closely related to Vatti, but I have improved on it in several ways. So far I can only find references to people who are improving on the graph based algorithm and performing all-pairs brute force line intersection. Do you know of any work that improves directly on Vatti rather than merely comparing yet-another-graph-travering algorithm to Vatti?
>
Thought I already mentioned that, GPC:
http://www.cs.man.ac.uk/~toby/alan/software/
<http://www.cs.man.ac.uk/%7Etoby/alan/software/>
Barend
- Next message: Eric Niebler: "Re: [boost] [accumulator] reset?"
- Previous message: Barend Gehrels: "[boost] [geometry] [impl] Concepts"
- In reply to: Simonson, Lucanus J: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
- Next in thread: Phil Endecott: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
- Reply: Phil Endecott: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"
- Reply: Simonson, Lucanus J: "Re: [boost] [geometry] [impl] polygon relations [was: area area, length, centroid, behavior]"