mirror of
https://github.com/genxium/DelayNoMore
synced 2024-12-26 11:48:56 +00:00
51 lines
1.1 KiB
Go
51 lines
1.1 KiB
Go
package dnmshared
|
|
|
|
import (
|
|
. "dnmshared/sharedprotos"
|
|
"math"
|
|
)
|
|
|
|
func NormVec2D(dx, dy float64) Vec2D {
|
|
return Vec2D{X: dy, Y: -dx}
|
|
}
|
|
|
|
func AlignPolygon2DToBoundingBox(input *Polygon2D) *Polygon2D {
|
|
// Transform again to put "anchor" at the top-left point of the bounding box for "resolv"
|
|
boundingBoxTL := &Vec2D{
|
|
X: math.MaxFloat64,
|
|
Y: math.MaxFloat64,
|
|
}
|
|
for _, p := range input.Points {
|
|
if p.X < boundingBoxTL.X {
|
|
boundingBoxTL.X = p.X
|
|
}
|
|
if p.Y < boundingBoxTL.Y {
|
|
boundingBoxTL.Y = p.Y
|
|
}
|
|
}
|
|
|
|
// Now "input.Anchor" should move to "input.Anchor+boundingBoxTL", thus "boundingBoxTL" is also the value of the negative diff for all "input.Points"
|
|
output := &Polygon2D{
|
|
Anchor: &Vec2D{
|
|
X: input.Anchor.X + boundingBoxTL.X,
|
|
Y: input.Anchor.Y + boundingBoxTL.Y,
|
|
},
|
|
Points: make([]*Vec2D, len(input.Points)),
|
|
}
|
|
|
|
for i, p := range input.Points {
|
|
output.Points[i] = &Vec2D{
|
|
X: p.X - boundingBoxTL.X,
|
|
Y: p.Y - boundingBoxTL.Y,
|
|
}
|
|
}
|
|
|
|
return output
|
|
}
|
|
|
|
func Distance(pt1 *Vec2D, pt2 *Vec2D) float64 {
|
|
dx := pt1.X - pt2.X
|
|
dy := pt1.Y - pt2.Y
|
|
return math.Sqrt(dx*dx + dy*dy)
|
|
}
|