// Copyright (C) Stichting Deltares 2018. All rights reserved. // // This file is part of the application DAM - UI. // // DAM - UI is free software: you can redistribute it and/or modify // it under the terms of the GNU General Public License as published by // the Free Software Foundation, either version 3 of the License, or // (at your option) any later version. // // This program is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the // GNU General Public License for more details. // // You should have received a copy of the GNU General Public License // along with this program. If not, see . // // All names, logos, and references to "Deltares" are registered trademarks of // Stichting Deltares and remain full property of Stichting Deltares at all times. // All rights reserved. using System.Collections.Generic; using System.Linq; namespace Deltares.Maps { public static class GeometryRepositoryExtensions { /// /// Determines if lines in the source repository have an intersection with lines in the target repository, /// the result is grouped by the count of intersection points /// /// /// /// /// A list of target and source geometries and the calculated intersection points grouped by the count of /// intersection points /// public static IEnumerable> GetIntersectionPoints( this IFeatureRepository sourceRepository, IFeatureRepository targetRepository) { /* var results = from source in sourceRepository.Features from target in targetRepository.Query(source) let intersectionPoints = target.Geometry.Intersection(source.Geometry) select new IntersectionResult() { Source = source, Target = target, IntersectionPoints = intersectionPoints.Coordinates }; */ var results = new List(); foreach (IFeature source in sourceRepository.Features) { foreach (IFeature target in targetRepository.Query(source)) { results.Add(new IntersectionResult { Source = source, Target = target, IntersectionPoints = target.Geometry.Intersection(source.Geometry).Coordinates }); } } return from result in results group result by result.IntersectionPoints.Count(); } public static IEnumerable GetResultsHavingCount( this IEnumerable> results, int count) { IGrouping havingKey = results.FirstOrDefault(r => r.Key == count); return havingKey == null ? new List() : havingKey.Select(r => r); } } }