SegmentIntersectionTester.cs :  » GIS » DeepEarth » GisSharpBlog » NetTopologySuite » Operation » Predicate » C# / CSharp Open Source

Home
C# / CSharp Open Source
1.2.6.4 mono .net core
2.2.6.4 mono core
3.Aspect Oriented Frameworks
4.Bloggers
5.Build Systems
6.Business Application
7.Charting Reporting Tools
8.Chat Servers
9.Code Coverage Tools
10.Content Management Systems CMS
11.CRM ERP
12.Database
13.Development
14.Email
15.Forum
16.Game
17.GIS
18.GUI
19.IDEs
20.Installers Generators
21.Inversion of Control Dependency Injection
22.Issue Tracking
23.Logging Tools
24.Message
25.Mobile
26.Network Clients
27.Network Servers
28.Office
29.PDF
30.Persistence Frameworks
31.Portals
32.Profilers
33.Project Management
34.RSS RDF
35.Rule Engines
36.Script
37.Search Engines
38.Sound Audio
39.Source Control
40.SQL Clients
41.Template Engines
42.Testing
43.UML
44.Web Frameworks
45.Web Service
46.Web Testing
47.Wiki Engines
48.Windows Presentation Foundation
49.Workflows
50.XML Parsers
C# / C Sharp
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source » GIS » DeepEarth 
DeepEarth » GisSharpBlog » NetTopologySuite » Operation » Predicate » SegmentIntersectionTester.cs
using System.Collections;
using GeoAPI.Geometries;
using GisSharpBlog.NetTopologySuite.Algorithm;
using GisSharpBlog.NetTopologySuite.Geometries;

namespace GisSharpBlog.NetTopologySuite.Operation.Predicate{
    /// <summary>
    /// Tests if any line segments in two sets of CoordinateSequences intersect.
    /// Optimized for small geometry size.
    /// Short-circuited to return as soon an intersection is found.
    /// </summary>
    public class SegmentIntersectionTester 
    {
        // for purposes of intersection testing, don't need to set precision model
        private LineIntersector li = new RobustLineIntersector();

        private bool hasIntersection = false;
        private ICoordinate pt00 = new Coordinate();
        private ICoordinate pt01 = new Coordinate();
        private ICoordinate pt10 = new Coordinate();
        private ICoordinate pt11 = new Coordinate();

        /// <summary>
        /// 
        /// </summary>
        public SegmentIntersectionTester() { }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="seq"></param>
        /// <param name="lines"></param>
        /// <returns></returns>
        public bool HasIntersectionWithLineStrings(ICoordinateSequence seq, IList lines)
        {
            for (IEnumerator i = lines.GetEnumerator(); i.MoveNext(); ) 
            {
                ILineString line = (ILineString) i.Current;
                HasIntersection(seq, line.CoordinateSequence);
                if (hasIntersection)
                    break;
            }
            return hasIntersection;
        }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="seq0"></param>
        /// <param name="seq1"></param>
        /// <returns></returns>
        public bool HasIntersection(ICoordinateSequence seq0, ICoordinateSequence seq1) 
        {
            for (int i = 1; i < seq0.Count && ! hasIntersection; i++) 
            {
                seq0.GetCoordinate(i - 1, pt00);
                seq0.GetCoordinate(i, pt01);
                for (int j = 1; j < seq1.Count && ! hasIntersection; j++) 
                {
                    seq1.GetCoordinate(j - 1, pt10);
                    seq1.GetCoordinate(j, pt11);
                    li.ComputeIntersection(pt00, pt01, pt10, pt11);
                    if (li.HasIntersection)
                        hasIntersection = true;
                }
            }
            return hasIntersection;
        }
    }
}
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.