One suggestion to optomize the performance of youe final algorithm is to order and index the coordinate columns of your tables involved.
This is a very interesting problem to solve! I look forward to reading about your solution. Regards Michael Hanna -----Original Message----- From: Laurence Seeff [mailto:[EMAIL PROTECTED]] Sent: Thursday, January 31, 2002 5:44 AM To: MI-List Subject: MI-L Polygon neighbours Hi, This one looks like a real challenge... I have a floor space with polygons indicating the layout of tables on = the floor space. I need to calculate the gross area of each table which = is defined as follows: Net area (table surface area) PLUS the area of = half the distance from the table being calculated to neighbouring = tables. Essentially, something similar to voronoi polygons around = polygons (not points). The table layout is may not be symetric and table = sizes may vary. Any ideas of mbx's to do this, or any idea of an algorithm to determine = the neighbours and distance calculations? Quite a tall order, I know! Thanks... Laurence Seeff Points Business Mapping Ltd. 22 Tuval St., Ramat Gan, 52522, Israel =20 Tel: +972-3-6126216 Fax: +972-3-6126323 Email: [EMAIL PROTECTED] Web: www.points.co.il _______________________________________________________________________ List hosting provided by Directions Magazine | www.directionsmag.com | To unsubscribe, send e-mail to [EMAIL PROTECTED] and put "unsubscribe MapInfo-L" in the message body. _______________________________________________________________________ List hosting provided by Directions Magazine | www.directionsmag.com | To unsubscribe, send e-mail to [EMAIL PROTECTED] and put "unsubscribe MapInfo-L" in the message body.
