Re: Overlap removal
Kristof Bastiaensen <[email protected]>
| Newsgroups | gmane.comp.fonts.fontforge.devel |
|---|---|
| Message-ID | <[email protected]> |
I have tried these examples with the bezier clipping algorihm I implemented in haskell, and it didn't have a problem with them. "Locating all the intersections between two Bezier curves is a difficult general problem, because of the variety of degenerate cases." This is simply not true, there aren't a lot of degenerate cases to handle. Only one that comes to mind is infinite intersections, in which case it will happily give an infinite number of intersections. This page is somewhat misleading, since it doesn't give any pointers to recent research. No mention is made of bezier clipping, implicitization, or even a simple recursive subdivision algorithm. Kristof On 29-06-14 12:12, Werner LEMBERG wrote: >> I've looked at the boolops toy in 2geom. It's not clear to me if >> and how it handles self overlapping paths. > Here's some additional food for Bezier intersection: > > http://www.truetex.com/bezint.htm > > I guess the torture examples at the end are useful. > > > Werner ------------------------------------------------------------------------------ Open source business process management suite built on Java and Eclipse Turn processes into business applications with Bonita BPM Community Edition Quickly connect people, data, and systems into organized workflows Winner of BOSSIE, CODIE, OW2 and Gartner awards http://p.sf.net/sfu/Bonitasoft