LineSegmentIndex.cs :  » GIS » DeepEarth » GisSharpBlog » NetTopologySuite » Simplify » 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 » Simplify » LineSegmentIndex.cs
using System;
using System.Collections;
using GisSharpBlog.NetTopologySuite.Geometries;
using GisSharpBlog.NetTopologySuite.Index;
using GisSharpBlog.NetTopologySuite.Index.Quadtree;
using System.Collections.Generic;

namespace GisSharpBlog.NetTopologySuite.Simplify{
    /// <summary>
    /// An index of LineSegments.
    /// </summary>
    public class LineSegmentIndex
    {
        private Quadtree index = new Quadtree();

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

        /// <summary>
        /// 
        /// </summary>
        /// <param name="line"></param>
        public void Add(TaggedLineString line) 
        {
            TaggedLineSegment[] segs = line.Segments;
            for (int i = 0; i < segs.Length - 1; i++) 
            {
                TaggedLineSegment seg = segs[i];
                Add(seg);
            }
        }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="seg"></param>
        public void Add(LineSegment seg)
        {
            index.Insert(new Envelope(seg.P0, seg.P1), seg);
        }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="seg"></param>
        public void Remove(LineSegment seg)
        {
            index.Remove(new Envelope(seg.P0, seg.P1), seg);
        }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="querySeg"></param>
        /// <returns></returns>
        public IList Query(LineSegment querySeg)
        {
            Envelope env = new Envelope(querySeg.P0, querySeg.P1);

            LineSegmentVisitor visitor = new LineSegmentVisitor(querySeg);
            index.Query(env, visitor);
            var itemsFound = visitor.Items;        

            return itemsFound;
        }
    }

    /// <summary>
    /// ItemVisitor subclass to reduce volume of query results.
    /// </summary>
    public class LineSegmentVisitor : IItemVisitor
    {
        // MD - only seems to make about a 10% difference in overall time.
        private LineSegment querySeg;
    private List<LineSegment> items = new List<LineSegment>();

        /// <summary>
        /// 
        /// </summary>
        /// <param name="querySeg"></param>
        public LineSegmentVisitor(LineSegment querySeg) 
        {
            this.querySeg = querySeg;
        }

        /// <summary>
        /// 
        /// </summary>
        /// <param name="item"></param>
        public void VisitItem(Object item)
        {
            LineSegment seg = (LineSegment) item;
            if (Envelope.Intersects(seg.P0, seg.P1, querySeg.P0, querySeg.P1))
                items.Add(seg);
        }

        /// <summary>
        /// 
        /// </summary>
        public List<LineSegment> Items 
        {
            get
            {
                return items;
            }
        }
    }
}
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.