[10007] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
| 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System.Collections.Generic;
|
---|
| 23 | using System.Linq;
|
---|
| 24 |
|
---|
| 25 | namespace HeuristicLab.Analysis.AlgorithmBehavior.Analyzers {
|
---|
| 26 | public static class ConvexHullMeasures {
|
---|
[10008] | 27 | //Calculates the volumne of a d-simplex
|
---|
[10092] | 28 | private static double CalculateSimplexVolume(List<double[]> simplex) {
|
---|
| 29 | double[,] diffs = new double[simplex.Count, simplex.Count];
|
---|
[10007] | 30 |
|
---|
[10092] | 31 | for (int i = 0; i < simplex.Count; i++) {
|
---|
| 32 | for (int j = 0; j < simplex.Count; j++) {
|
---|
| 33 | diffs[i, j] = simplex[i].EuclideanDistance(simplex[j]);
|
---|
[10007] | 34 | }
|
---|
| 35 | }
|
---|
| 36 |
|
---|
| 37 | double det = alglib.rmatrixdet(diffs);
|
---|
[10092] | 38 | double result = det / simplex[0].Count().Fact();
|
---|
[10007] | 39 |
|
---|
| 40 | return result;
|
---|
| 41 | }
|
---|
| 42 |
|
---|
[10060] | 43 | //calculate center for boundary triangulation (slowwwww.....)
|
---|
[10008] | 44 | private static double[] CalculateInnerPoint(List<double[]> hyperHull) {
|
---|
| 45 | double[] result = new double[hyperHull[0].Count()];
|
---|
| 46 |
|
---|
| 47 | for (int i = 0; i < hyperHull[0].Count(); i++) {
|
---|
[10060] | 48 | result[i] = (hyperHull.Max(x => x[i]) + hyperHull.Min(x => x[i])) / 2.0;
|
---|
[10008] | 49 | }
|
---|
| 50 |
|
---|
| 51 | return result;
|
---|
| 52 | }
|
---|
| 53 |
|
---|
| 54 | //calculates the volume of a convex d-polytope
|
---|
| 55 | //decomposition based on boundary triangulation
|
---|
| 56 | public static double CalculateVolume(List<double[]> hyperHull) {
|
---|
| 57 | double[] innerPoint = CalculateInnerPoint(hyperHull);
|
---|
| 58 | double volume = 0.0;
|
---|
| 59 |
|
---|
| 60 | for (int i = 0; i < hyperHull.Count - 1; i += 2) {
|
---|
| 61 | List<double[]> simplex = new List<double[]>();
|
---|
| 62 | simplex.Add(innerPoint);
|
---|
| 63 | simplex.Add(hyperHull[i]);
|
---|
| 64 | simplex.Add(hyperHull[i + 1]);
|
---|
| 65 | volume += CalculateSimplexVolume(simplex);
|
---|
| 66 | }
|
---|
| 67 | return volume;
|
---|
| 68 | }
|
---|
[10007] | 69 | }
|
---|
| 70 | }
|
---|