/
point2f.go
141 lines (119 loc) · 2.71 KB
/
point2f.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
package main
import (
"encoding"
"encoding/binary"
"errors"
"math"
"math/rand"
"strconv"
)
type Point2f struct {
X, Y float64
}
func Pt2f(x, y float64) Point2f {
return Point2f{
X: x,
Y: y,
}
}
func (a Point2f) String() string {
var (
sX = strconv.FormatFloat(a.X, 'g', -1, 64)
sY = strconv.FormatFloat(a.Y, 'g', -1, 64)
)
return "(" + sX + "," + sY + ")"
}
var (
_ encoding.BinaryMarshaler = Point2f{}
_ encoding.BinaryUnmarshaler = (*Point2f)(nil)
)
func (a Point2f) MarshalBinary() (data []byte, err error) {
var (
uX = math.Float64bits(a.X)
uY = math.Float64bits(a.Y)
)
data = make([]byte, 2*8)
binary.BigEndian.PutUint64(data[0:], uX)
binary.BigEndian.PutUint64(data[8:], uY)
return data, nil
}
func (p *Point2f) UnmarshalBinary(data []byte) error {
if len(data) < 2*8 {
return errors.New("insufficient data length")
}
var (
uX = binary.BigEndian.Uint64(data[0:])
uY = binary.BigEndian.Uint64(data[8:])
)
p.X = math.Float64frombits(uX)
p.Y = math.Float64frombits(uY)
return nil
}
func (a Point2f) Add(b Point2f) Point2f {
return Point2f{
X: a.X + b.X,
Y: a.Y + b.Y,
}
}
func (a Point2f) Sub(b Point2f) Point2f {
return Point2f{
X: a.X - b.X,
Y: a.Y - b.Y,
}
}
func (a Point2f) MulScalar(scalar float64) Point2f {
return Point2f{
X: a.X * scalar,
Y: a.Y * scalar,
}
}
func (a Point2f) DivScalar(scalar float64) Point2f {
return Point2f{
X: a.X / scalar,
Y: a.Y / scalar,
}
}
func randPoint2f(r *rand.Rand) Point2f {
return Point2f{
X: r.Float64(),
Y: r.Float64(),
}
}
func Distance(a, b Point2f) float64 {
var (
dx = a.X - b.X
dy = a.Y - b.Y
)
return math.Sqrt(dx*dx + dy*dy)
}
// A:[a0,a1], B:[b0,b1]
func Intersection(a0, a1, b0, b1 Point2f) (Point2f, bool) {
var (
dir0 = a1.Sub(a0)
dir1 = b1.Sub(b0)
)
//считаем уравнения прямых проходящих через отрезки
var (
d0Y = -dir0.Y
d0X = +dir0.X
d0 = -(d0Y*a0.X + d0X*a0.Y)
)
var (
d1Y = -dir1.Y
d1X = +dir1.X
d1 = -(d1Y*b0.X + d1X*b0.Y)
)
// подставляем концы отрезков, для выяснения в каких полуплоскотях они
seg1_line2_start := d1Y*a0.X + d1X*a0.Y + d1
seg1_line2_end := d1Y*a1.X + d1X*a1.Y + d1
seg2_line1_start := d0Y*b0.X + d0X*b0.Y + d0
seg2_line1_end := d0Y*b1.X + d0X*b1.Y + d0
//если концы одного отрезка имеют один знак, значит он в одной полуплоскости и пересечения нет.
if (seg1_line2_start*seg1_line2_end >= 0) ||
(seg2_line1_start*seg2_line1_end >= 0) {
return Point2f{}, false
}
u := seg1_line2_start / (seg1_line2_start - seg1_line2_end)
p := a0.Add(dir0.MulScalar(u))
return p, true
}