Polygons & Nodal Points...

[schoon at amgt.com]

~sdpm~
Good Afternoon!

	I have this polygon I need to split up into in smaller elements and
determine how many nodal points I have.... My first attempt was to brute
force the problem and just see if my nodal points fell within the
polygon, and start counting - but under certain conditions that fails.
It mostly fails when the point is on an edge of the polygon... My second
idea is to calculate how many nodal points I'm going to have by how many
subelements are present. I'm developing the application using Perl/Tk,
but I am new to using it. There might be a third way to determine nodal
points by using createRectangle. I'm not looking for a direct solution -
more along the lines of a brain storm. Any ideas greatly appreciated!!

Thanks Again!

.mark

~sdpm~

The posting address is: san-diego-pm-list at hfb.pm.org

List requests should be sent to: majordomo at hfb.pm.org

If you ever want to remove yourself from this mailing list,
you can send mail to <majordomo at happyfunball.pm.org> with the following
command in the body of your email message:

    unsubscribe san-diego-pm-list

If you ever need to get in contact with the owner of the list,
(if you have trouble unsubscribing, or have questions about the
list itself) send email to <owner-san-diego-pm-list at happyfunball.pm.org> .
This is the general rule for most mailing lists when you need
to contact a human.