Forked from reeichert/ClosedConvexHullCLLocationCoordinate2D.swift
Created
October 9, 2020 11:26
-
-
Save lukewakeford/d3506dec2ec24e3299f757243462752b to your computer and use it in GitHub Desktop.
Closed convex hull CLLocationCoordinate2D
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
func sortConvex(input: [CLLocationCoordinate2D]) -> [CLLocationCoordinate2D] { | |
// X = longitude | |
// Y = latitudeß | |
// 2D cross product of OA and OB vectors, i.e. z-component of their 3D cross product. | |
// Returns a positive value, if OAB makes a counter-clockwise turn, | |
// negative for clockwise turn, and zero if the points are collinear. | |
func cross(P: CLLocationCoordinate2D, A: CLLocationCoordinate2D, B: CLLocationCoordinate2D) -> Double { | |
let part1 = (A.longitude - P.longitude) * (B.latitude - P.latitude) | |
let part2 = (A.latitude - P.latitude) * (B.longitude - P.longitude) | |
return part1 - part2; | |
} | |
// Sort points lexicographically | |
let points = input.sorted() { | |
$0.longitude == $1.longitude ? $0.latitude < $1.latitude : $0.longitude < $1.longitude | |
} | |
// Build the lower hull | |
var lower: [CLLocationCoordinate2D] = [] | |
for p in points { | |
while lower.count >= 2 && cross(P: lower[lower.count - 2], A: lower[lower.count - 1], B: p) <= 0 { | |
lower.removeLast() | |
} | |
lower.append(p) | |
} | |
// Build upper hull | |
var upper: [CLLocationCoordinate2D] = [] | |
for p in points.reversed() { | |
while upper.count >= 2 && cross(P: upper[upper.count-2], A: upper[upper.count-1], B: p) <= 0 { | |
upper.removeLast() | |
} | |
upper.append(p) | |
} | |
// Last point of upper list is omitted because it is repeated at the | |
// beginning of the lower list. | |
upper.removeLast() | |
// Concatenation of the lower and upper hulls gives the convex hull. | |
return (upper + lower) | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment