FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
geometry/test/algorithms/intersects/intersects_self.cpp at develop · boostorg/geometry · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
boostorg
/
geometry
Public
Notifications
You must be signed in to change notification settings
Fork
232
Star
516
Code
Issues
145
Pull requests
11
Discussions
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
geometry
/
test
/
algorithms
/
intersects
/
intersects_self.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
126 lines (95 loc) · 4.34 KB
Breadcrumbs
geometry
/
test
/
algorithms
/
intersects
/
intersects_self.cpp
Copy path
File metadata and controls
126 lines (95 loc) · 4.34 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
//
Boost.Geometry (aka GGL, Generic Geometry Library)
//
Copyright (c) 2007-2015 Barend Gehrels, Amsterdam, the Netherlands.
//
Copyright (c) 2013-2015 Adam Wulkiewicz, Lodz, Poland.
//
This file was modified by Oracle on 2013, 2015.
//
Modifications copyright (c) 2013-2015, Oracle and/or its affiliates.
//
Use, modification and distribution is subject to the Boost Software License,
//
Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
//
http://www.boost.org/LICENSE_1_0.txt)
#
include
"
test_intersects.hpp
"
#
include
<
boost/geometry/geometries/geometries.hpp
>
#
include
<
boost/geometry/geometries/point_xy.hpp
>
#
include
<
boost/geometry/util/rational.hpp
>
template
<
typename
P>
void
test_all
()
{
typedef
bg::model::linestring<P> linestring;
typedef
bg::model::polygon<P> polygon;
typedef
bg::model::ring<P> ring;
typedef
bg::model::ring<P,
true
,
false
> ring_open;
//
self-intersecting is not tested in disjoint, so that is done here.
//
Just a normal polygon
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,1.5 2.5,2.5 1.5,4 0,0 0))
"
,
false
);
//
Self intersecting
test_self_intersects<polygon>(
"
POLYGON((1 2,1 1,2 1,2 2.25,3 2.25,3 0,0 0,0 3,3 3,2.75 2,1 2))
"
,
true
);
//
Self intersecting in last segment
test_self_intersects<polygon>(
"
POLYGON((0 2,2 4,2 0,4 2,0 2))
"
,
true
);
//
Self tangent
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 4,4 0,2 4,0 0))
"
,
true
);
//
Self tangent in corner
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 4,4 0,0 4,2 0,0 0))
"
,
true
);
//
With spike
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 4,4 2,6 2,4 2,4 0,0 0))
"
,
true
);
//
Non intersection, but with duplicate
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 0,4 0,0 0))
"
,
false
);
//
With many duplicates
test_self_intersects<polygon>(
"
POLYGON((0 0,0 1,0 1,0 1,0 2,0 2,0 3,0 3,0 3,0 3,0 4,2 4,2 4,4 4,4 0,4 0,3 0,3 0,3 0,3 0,3 0,0 0))
"
,
false
);
//
Hole: interior tangent to exterior
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 4,4 0,0 0),(1 2,2 4,3 2,1 2))
"
,
true
);
//
Hole: interior intersecting exterior
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 4,4 0,0 0),(1 1,1 3,5 4,1 1))
"
,
true
);
//
Hole: two intersecting holes
test_self_intersects<polygon>(
"
POLYGON((0 0,0 4,4 4,4 0,0 0),(1 1,1 3,3 3,3 1,1 1),(2 2,2 3.5,3.5 3.5,3.5 2,2 2))
"
,
true
);
//
Mail Akira T on [Boost-users] at 27-7-2011 3:17
test_self_intersects<linestring>(
"
LINESTRING(0 0,0 4,4 4,2 2,2 5)
"
,
true
);
test_self_intersects<linestring>(
"
LINESTRING(0 4,4 4,2 2,2 5)
"
,
true
);
//
Test self-intersections at last segment in close/open rings:
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,4 1,0 0))
"
,
false
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,3 3,4 1))
"
,
false
);
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,4 1,0 1,0 0))
"
,
true
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,3 3,4 1,0 1))
"
,
true
);
//
Duplicates in first or last
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,4 1,0 1,0 1,0 0))
"
,
true
);
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,4 1,0 1,0 0,0 0))
"
,
true
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,3 3,4 1,0 1,0 1))
"
,
true
);
test_self_intersects<ring>(
"
POLYGON((0 0,0 0,3 3,4 1,0 1,0 1,0 0))
"
,
true
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,0 0,3 3,4 1,0 1,0 1))
"
,
true
);
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,3 3,4 1,0 1,0 1,0 0))
"
,
true
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,3 3,3 3,4 1,0 1,0 1))
"
,
true
);
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,4 1,0 0,0 0))
"
,
false
);
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,4 1,4 1,0 0))
"
,
false
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,3 3,4 1,4 1))
"
,
false
);
test_self_intersects<ring>(
"
POLYGON((0 0,0 0,3 3,4 1,0 0))
"
,
false
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,0 0,3 3,4 1))
"
,
false
);
test_self_intersects<ring>(
"
POLYGON((0 0,3 3,3 3,4 1,0 0))
"
,
false
);
test_self_intersects<ring_open>(
"
POLYGON((0 0,3 3,3 3,4 1))
"
,
false
);
}
int
test_main
(
int
,
char
* [] )
{
test_all<bg::model::d2::point_xy<
double
> >();
test_all<bg::model::d2::point_xy<boost::rational<
int
> > >();
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL