core/gg
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Implemented ContainsPoint function.

Browse source
This commit is contained in:
Andrey Parhomenko 2023-05-28 21:22:52 +03:00
parent 3259b8ba8d
commit a3cf74a971
2 changed files with 14 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

1
src/cmd/math/main.go
View file

@ -33,6 +33,7 @@ func main() {
gx.Point{1, 0},
}.Line()
fmt.Println(l1.Crosses(l2))
fmt.Println(l1.ContainsPoint(gx.Point{1, 4}))
/*t := gx.Triangle{
gx.Point{0, 0},
gx.Point{0, 100},

17
src/gx/line.go
View file

@ -31,12 +31,17 @@ func (l Line) Line() Line {
return l
}
func (l Line) Crosses(with Liner) (Point, bool) {
// Parallel liners cannot cross by definition.
if l.Parallel(with) {
return Point{}, false
func (l Line) ContainsPoint(p Point) bool {
buf := Line{0, p.Y}
pc, ok := l.crossesLine(buf)
if !ok {
return false
}
return pc == p
}
func (l Line) Crosses(with Liner) (Point, bool) {
switch with.(type) {
case Line :
return l.crossesLine(with.(Line))
@ -48,6 +53,10 @@ func (l Line) Crosses(with Liner) (Point, bool) {
}
func (l1 Line) crossesLine(l2 Line) (Point, bool) {
if l1.Parallel(l2) {
return Point{}, false
}
x := (l1.C - l2.C) / (l2.K - l1.K)
y := l1.K*x + l1.C
return Point{x, y}, true