convexHull

Documentation

Overview

Package convexHull provides an algotithm for finding a convex hull from a set of point. Implemented algorithm: https://en.wikibooks.org/wiki/Algorithm_Implementation/Geometry/Convex_hull/Monotone_chain

Index

• type Point
• type Points
  • func (points Points) Len() int
  • func (points Points) Less(i, j int) bool
  • func (points Points) Swap(i, j int)

Types

type Point

type Point struct {
	X, Y int
}

Point is a struct that holds the X Y cooridinates of a specific point in the Ecliden plane or space.

type Points

type Points []Point

Points is a slice built up of Point structs.

func (Points) Len

func (points Points) Len() int

func (Points) Less

func (points Points) Less(i, j int) bool

lets sort our Points by x and, if equal, by y

func (Points) Swap

func (points Points) Swap(i, j int)