-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.go
113 lines (97 loc) · 1.89 KB
/
index.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
package index
import (
"github.com/dhconnelly/rtreego"
"github.com/paulsmith/gogeos/geos"
)
type Element struct {
id string
geom *geos.PGeometry
envelope *rtreego.Rect
}
func (t *Element) Bounds() *rtreego.Rect {
return t.envelope
}
// Create a new Element
func NewElement(id string, geom *geos.Geometry) (elem *Element, geosError error) {
var (
minX float64
minY float64
maxX float64
maxY float64
err error
)
// Get the envelope
bounds, err := geom.Envelope()
if err != nil {
return nil, err
}
shell, err := bounds.Shell()
if err != nil {
return nil, err
}
points, err := shell.NPoint()
if err != nil {
return nil, err
}
// Set the initial point
initialPoint, err := shell.Point(0)
if err != nil {
return nil, err
}
minX, err = initialPoint.X()
if err != nil {
return nil, err
}
minY, err = initialPoint.Y()
if err != nil {
return nil, err
}
maxX, err = initialPoint.X()
if err != nil {
return nil, err
}
maxY, err = initialPoint.Y()
// Get min and max x/y
for i := 1; i < points; i++ {
point, err := shell.Point(i)
if err != nil {
return nil, err
}
x, err := point.X()
if err != nil {
return nil, err
}
y, err := point.Y()
if err != nil {
return nil, err
}
if x <= minX && y <= minY {
minX = x
minY = y
}
if x >= maxX && y >= maxY {
maxX = x
maxY = y
}
}
// Create rectangle from min/max points
r1, err := rtreego.NewRect(rtreego.Point{minX,minY}, []float64{maxX-minX,maxY-minY})
if err != nil {
return nil, err
}
pgeom := geom.Prepare()
return &Element{id, pgeom, r1}, nil
}
type Index struct {
rtree *rtreego.Rtree
}
func (t *Index) Insert(elem *Element) {
t.rtree.Insert(elem)
}
func (t *Index) Remove(elem *Element) {
t.rtree.Delete(elem)
}
func NewIndex() *Index {
rt := rtreego.NewTree(2, 25, 50)
return &Index{rt}
}