Skip Menu |
 

This queue is for tickets about the Math-Polygon CPAN distribution.

Report information
The Basics
Id: 26675
Status: open
Priority: 0/
Queue: Math-Polygon

People
Owner: Nobody in particular
Requestors: ville9 [...] softpres.org
Cc:
AdminCc:

Bug Information
Severity: Wishlist
Broken in: (no value)
Fixed in: (no value)



Subject: polygon intersection
Download (untitled) / with headers
text/plain 263b
I'd like to have something like $poly->intersect($other_poly) which returns a new Math::Polygon object representing the intersection of $poly and $other_poly, or undef if both polygons don't intersect. Do you have planned something like this? Regards, Christian
Subject: Re: [rt.cpan.org #26675] polygon intersection
Date: Thu, 26 Apr 2007 09:30:38 +0200
To: Christian Sauer via RT <bug-Math-Polygon [...] rt.cpan.org>
From: Mark Overmeer <solutions [...] overmeer.net>
Download (untitled) / with headers
text/plain 989b
* Christian Sauer via RT (bug-Math-Polygon@rt.cpan.org) [070426 01:45]: Show quoted text
> I'd like to have something like $poly->intersect($other_poly) which > returns a new Math::Polygon object representing the intersection of > $poly and $other_poly, or undef if both polygons don't intersect. > > Do you have planned something like this?
At least, this will return a (maybe empty) LIST of objects in the general case. No, I have no plans for this, but if you show me the algorithm (maybe limited to convex polys, for which you test), I will add it. I do require some tests and docs as well. Is not easy. -- MarkOv ------------------------------------------------------------------------ Mark Overmeer MSc MARKOV Solutions drs Mark A.C.J. Overmeer MARKOV Solutions Mark@Overmeer.net solutions@overmeer.net http://Mark.Overmeer.net http://solutions.overmeer.net
From: ville9 [...] softpres.org
Download (untitled) / with headers
text/plain 967b
On Do. 26. Apr. 2007, 03:31:04, solutions@overmeer.net wrote: Show quoted text
> * Christian Sauer via RT (bug-Math-Polygon@rt.cpan.org) [070426 01:45]:
> > I'd like to have something like $poly->intersect($other_poly) which > > returns a new Math::Polygon object representing the intersection of > > $poly and $other_poly, or undef if both polygons don't intersect. > > > > Do you have planned something like this?
> > At least, this will return a (maybe empty) LIST of objects in the > general case. > > No, I have no plans for this, but if you show me the algorithm (maybe > limited to convex polys, for which you test), I will add it. I do > require some tests and docs as well. Is not easy.
Sorry, I don't have an algorithm yet - but I found that paper: http://citeseer.ist.psu.edu/cache/papers/cs/25021/http:zSzzSzfractal.dam.fmph.uniba.skzSz~sccgzSzproceedingszSz1998zSzZalik.pdf/zalik98quick.pdf A limitation to convex polygons would be ok of course! Regards, Christian
Subject: Re: [rt.cpan.org #26675] polygon intersection
Date: Fri, 27 Apr 2007 09:40:40 +0200
To: Christian Sauer via RT <bug-Math-Polygon [...] rt.cpan.org>
From: Mark Overmeer <solutions [...] overmeer.net>
Download (untitled) / with headers
text/plain 981b
* Christian Sauer via RT (bug-Math-Polygon@rt.cpan.org) [070427 01:20]: Show quoted text
Looks like a nice project for a long Winter-evening. Probably a few of them. I'll not be the one who implements and tests this: too many other modules which have higher priorities. If you (can find someone) create the perl implementation an tests, then I will glue that into the package nicely. -- Regards, MarkOv ------------------------------------------------------------------------ Mark Overmeer MSc MARKOV Solutions Mark@Overmeer.net solutions@overmeer.net http://Mark.Overmeer.net http://solutions.overmeer.net
From: ville9 [...] softpres.org
On Fr. 27. Apr. 2007, 03:41:00, solutions@overmeer.net wrote: Show quoted text
> * Christian Sauer via RT (bug-Math-Polygon@rt.cpan.org) [070427 > 01:20]:
> > Ticket <URL: http://rt.cpan.org/Ticket/Display.html?id=26675 > > > > > Sorry, I don't have an algorithm yet - but I found that paper: > >
>
http://citeseer.ist.psu.edu/cache/papers/cs/25021/http:zSzzSzfractal.dam.fmph.uniba.skzSz~sccgzSzproceedingszSz1998zSzZalik.pdf/zalik98quick.pdf Show quoted text
> > Looks like a nice project for a long Winter-evening. Probably a few > of > them. > > I'll not be the one who implements and tests this: too many other > modules > which have higher priorities. If you (can find someone) create the > perl > implementation an tests, then I will glue that into the package > nicely.
Ok, it's really not trivial and I understand you. :) Currently I can get along with a combination of rotate() and fillClip1() as one of the polygons that I need to intersect is always a (rotated) rectangle. And I'll try to implement a more generic intersection algorithm when needed... Regards, Christian


This service is sponsored and maintained by Best Practical Solutions and runs on Perl.org infrastructure.

Please report any issues with rt.cpan.org to rt-cpan-admin@bestpractical.com.