I think the general problem is called the "Geodesic ham sandwich". A reference is: www-ma2.upc.es/~hurtado/ham.pdf. I didnt understand the words in this paper but fortunately there are pictures. So with any 2 regions that may or may not intersect, itspossible to find a median line string which you could then use to reform the regions.
I think you are right in that buried in a Voronoi diagram of all the points might be a solution. But how do you find it? (In cases of sets of points from circles it might be easier, but what about regions). Next question is "Is there another solution using good old trusty MapInfo buffers and a lot of cpu cycles?" ps. I googleflopped on the search: "MapInfo & ham sandwich". Phil. ----- Original Message ----- From: "Robert Crossley" <[EMAIL PROTECTED]> To: "Apers Mathieu" <[EMAIL PROTECTED]> Cc: "MapInfo List" <[EMAIL PROTECTED]> Sent: Monday, May 31, 2004 9:07 AM Subject: Re: MI-L RE: Buffering query - v2 > Mathieu, > > From your comment, I'd imagine that what you are after is the equivalent > of a cross between buffers and veroni polygons for points, that is a > buffer that follows the mid-line between two polygons if they are less > than two buffer widths apart. > > I posted a question about this a while ago and did not get any good > leads. I would actually be interested in making such a tool, but could > not think of an efficient way of proceeding with this. One thought was to > drop the polygons to constituent points and create veroni polygons of the > points. It did not work for points which were coincident. I really did > not spend much time on it, so would be interested in thoughts. As I write > this, some new ideas are emerging from the weekend murk. > > BTW, most of the object commands are available throught the objects menu > in MapInfo. MapBasic generally justs automates these. > > r > > > On Mon, 31 May 2004 10:08:47 +1200, Apers Mathieu > <[EMAIL PROTECTED]> wrote: > > > ok so it won't let me attach Doc files either (or PDFs). i give up. > > > > -----Original Message----- > > From: Apers Mathieu [mailto:[EMAIL PROTECTED] > > Sent: Monday, 31 May 2004 10:07 AM > > To: 'Mapinfo help forum (E-mail)' > > Subject: RE: MI-L RE: Buffering query - v2 > > > > > > Thanks to those of you who replied - unfortunately for me, i have no > > practical knowledge of Mapbasic and hence wouldn't have the foggiest > > idea of > > how to use Intersectnodes in Mapbasic, and i need seperate buffers for > > each > > object so "one buffer for all objects" wouldn't work either. > > > > See attached file: > > > > I would have thought there'd be a function that builds buffers like this, > > 'cause surely I'm not the only one who needs to buffer objects and have > > the > > buffers meet but not overlap??? > > > > TIA > > > > Cheers > > Mathieu > > > > > > > > > > This email with any attachments is confidential and may be subject to > > legal > > privilege. If it is not intended for you please reply immediately, > > destroy > > it and do not copy, disclose or use it in any way. > > > > > > > > This email with any attachments is confidential and may be subject to > > legal > > privilege. If it is not intended for you please reply immediately, > > destroy > > it and do not copy, disclose or use it in any way. > > > > --------------------------------------------------------------------- > > List hosting provided by Directions Magazine | www.directionsmag.com | > > To unsubscribe, e-mail: [EMAIL PROTECTED] > > For additional commands, e-mail: [EMAIL PROTECTED] > > Message number: 11961 > > > > > > -- > > Robert Crossley > Agtrix P/L > 9 Short St > PO Box 63 > New Brighton 2483 > Far Southern Queensland > AUSTRALIA > > 153.549004 E 28.517344 S > > P: 02 6680 1309 > F: New Connection > M: 0419 718 642 > E: [EMAIL PROTECTED] > W: www.agtrix.com > W: www.wotzhere.com > > --------------------------------------------------------------------- > List hosting provided by Directions Magazine | www.directionsmag.com | > To unsubscribe, e-mail: [EMAIL PROTECTED] > For additional commands, e-mail: [EMAIL PROTECTED] > Message number: 11962 > >
