Hi Richard. Self-intersected objects leaving the SelfIntersector are always ketp together as an aggregate (see the SelfIntersector documentation). Use a Deaggregator after the SelfIntersector to split up the aggregates into simple geometries. Good luck. /Nisse
________________________________ Från: [email protected] [mailto:[EMAIL PROTECTED] För Richard Wilkinson Skickat: den 1 december 2006 16:05 Till: [email protected] Ämne: RE: [fme] Re: Detecting Self Intersectsin a dataset Hi Mark, I tried something very similar but it does not seem to catch the required self intersects. I have attached an example polygon for which the selfintersector transform generates an _segment count of 1. In this case a very simple self intersect. I have others that are more complex. A few show _segment =2, others =1, never more than 2. The tracking from part of my workspace is 44 > SelfIntersector > 52 > tester = 2 15 = pass, 36 = fail The numbers don't add up! tester has 52 objects in, but only 51 out. Richard Wilkinson -----Original Message----- From: [email protected] [mailto:[EMAIL PROTECTED] On Behalf Of mark2atsafe Sent: 30 November 2006 17:33 To: [email protected] Subject: [fme] Re: Detecting Self Intersectsin a dataset Hi Richard, The SelfIntersector should add an attribute to the features telling you how many pieces an element was split into. Therefore just use a Tester to test for _segments > 1 and you'll have the intersecting features. With a unique ID (place a Counter before the SelfIntersector to create one if necessary) you could use a LineJoiner to recreate the intersecting features (set group-by = ID number) Hope this helps Mark Mark Ireland, Senior Product Specialist Safe Software Inc. Surrey, BC, CANADA [EMAIL PROTECTED] <mailto:support%40safe.com> http://www.safe.com <http://www.safe.com> Solutions for Spatial Data Translation, Distribution and Access --- In [email protected] <mailto:fme%40yahoogroups.com> , "Richard Wilkinson" <[EMAIL PROTECTED]> wrote: > > Hi, > > I want to provide a data creator with a list of self intersects in a > dataset he is producing. I do not want to clean any problems found as > some are quite complex and require data creator input to determine the > correct geometry. > > I have experimented with the Selfintersector transform. I can see that > I have 44 objects entering the selfintersector and 52 leaving it. But > how can I list which 8 are selfintersecting? > > Can anyone suggest an approach for me to try. > > Thanks > > Richard Wilkinson > Systems Analyst > Resources - ICT Services > Leicestershire County Council > 0116 2657709 > [EMAIL PROTECTED] > > > __________________________________________________________ > Leicestershire County Council - rated a 'four-star' council by the Audit Commission > __________________________________________________________ > > > This e-mail and any files transmitted with it are confidential. If you are not the intended recipient, any reading, printing, storage, disclosure, copying or any other action taken in respect of this e-mail is prohibited and may be unlawful. If you are not the intended recipient, please notify the sender immediately by using the reply function and then permanently delete what you have received. > > Incoming and outgoing e-mail messages are routinely monitored for compliance with Leicestershire County Council's policy on the use of electronic communications. The contents of e-mails may have to be disclosed to a request under the Data Protection Act 1998 and the Freedom of Information Act 2000. > > The views expressed by the author may not necessarily reflect the views or policies of the Leicestershire County Council. > > Attachments to e-mail messages may contain viruses that may damage your system. Whilst Leicestershire County Council has taken every reasonable precaution to minimise this risk, we cannot accept any liability for any damage which you sustain as a result of these factors. You are advised to carry out your own virus checks before opening any attachment. >
