<http://www.google.ca/search?hl=en&q=%22The+overlay+algorithm+is+not
+based+on+any+particular+%22+site%3Ajump-project.org&btnG=Google
+Search&meta=>
On 1-Aug-07, at 10:27 AM, Sanjay Jena wrote:
Hi Rick,
i think that Google crawls all archives too. But though you still
need to know the content of the mail you search. So, i guess,
asking the mailing list is just what a mailing list exists for.
Here comes the header of his mail:
JTS Topology Suite Development <jts-devel@lists.jump-project.org>
to JTS Topology Suite Development < jts-devel@lists.jump-project.org>
date Aug 30, 2006 1:00 PM
subject RE: [jts-devel] Detailled algorithm informations of the
used Overlayoperation in JTS
I studied the algorithm used in the JTS pretty well, as i used
parts of it in the implementation of my thesis. If you like i can
give you some more information about its proceeding.
Regards,
Sanjay
On 8/1/07, Rick Zoolker <[EMAIL PROTECTED]> wrote: Thanks Sanjay.
I'm embarrassed at asking a question that had already
been answered in the archives. I hate it when people do that ;-)
Unfortunately I didn't see any good means for searching through the
archives other than downloading each individual month's worth of
archives and looking through manually. Would you happen to know the
rough timeframe that the messages you speak of were being posted?
On 8/1/07, Sanjay Jena < [EMAIL PROTECTED]> wrote:
> Hi Rick,
>
> that's a question i had during my graduaton thesis last year.
Here comes the
> answer of Martin.
>
> "The overlay algorithm is not based on any particular published
work, but is
> my own design. It does follow a fairly well-established approach
(build a
> fully noded graph, label it appropriately, and extract the
desired linework
> from it). I've incorporated various enhancements to improve
robustness and
> performance.
>
> I would imagine a decent library would be able to obtain the
reference
> given. There are several other good papers out there, mostly
variations of
> the same basic approach."
> You can find the whole mails in the mailing list archives.
>
> Regards,
> Sanjay
>
>
>
> On 8/1/07, Rick Zoolker < [EMAIL PROTECTED]> wrote:
> >
> > OK, thorough digging through the code I think I have a somewhat
> > reasonable understanding as to what is going on algorithmically
in the
> > boolean operations ( e.g. Union, Intersection, etc), however I'm
> > wondering if the algorithm used here is based on something that
has
> > had a more thorough analysis like an academic paper or a writup
> > somewhere. I couldn't find any references to papers in the
javadoc or
> > in the documentation set.
> >
> > -Rick
> > _______________________________________________
> > jts-devel mailing list
> > jts-devel@lists.jump-project.org
> > http://lists.refractions.net/mailman/listinfo/jts-devel
> >
>
>
>
> --
> Sanjay Dominik Jena
>
> Cell phone: +55 21 82886322
> _______________________________________________
> jts-devel mailing list
> jts-devel@lists.jump-project.org
> http://lists.refractions.net/mailman/listinfo/jts-devel
>
>
_______________________________________________
jts-devel mailing list
jts-devel@lists.jump-project.org
http://lists.refractions.net/mailman/listinfo/jts-devel
--
Sanjay Dominik Jena
Cell phone: +55 21 82886322
_______________________________________________
jts-devel mailing list
jts-devel@lists.jump-project.org
http://lists.refractions.net/mailman/listinfo/jts-devel
_______________________________________________
jts-devel mailing list
jts-devel@lists.jump-project.org
http://lists.refractions.net/mailman/listinfo/jts-devel
