/
plot_recipes.jl
601 lines (405 loc) · 13 KB
/
plot_recipes.jl
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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
using RecipesBase
import RecipesBase.apply_recipe
function warn_empty_polytope()
@warn "received a polytope with no vertices during plotting"
end
# ====================================
# Plot recipes for an abstract LazySet
# ====================================
"""
plot_lazyset(S::LazySet; ...)
Plot a convex set in two dimensions using an axis-aligned approximation.
### Input
- `S` -- convex set
### Examples
```jldoctest
julia> using Plots, LazySets
julia> B = BallInf(ones(2), 0.1);
julia> plot(2.0 * B);
```
### Algorithm
For any 2D lazy set we compute its box overapproximation, followed by the list of
vertices. A post-processing `convex_hull` is applied to the vertices list;
this ensures that the shaded area inside the convex hull of the vertices is covered
correctly.
### Notes
This recipe detects if the axis-aligned approximation is such that the first two
vertices returned by `vertices_list` are the same. In that case, a scatter plot
is used (instead of a shape plot). This use case arises, for example, when
plotting singletons.
"""
@recipe function plot_lazyset(S::LazySet;
color="blue", label="", grid=true, alpha=0.5)
@assert dim(S) == 2 "cannot plot a $(dim(S))-dimensional set"
P = Approximations.overapproximate(S)
vlist = transpose(hcat(convex_hull(vertices_list(P))...))
if isempty(vlist)
warn_empty_polytope()
return []
end
(x, y) = vlist[:, 1], vlist[:, 2]
# add first vertex to "close" the polygon
push!(x, vlist[1, 1])
push!(y, vlist[1, 2])
seriestype := norm(vlist[1, :] - vlist[2, :]) ≈ 0 ? :scatter : :shape
x, y
end
"""
plot_lazyset(Xk::Vector{S}) where {S<:LazySet}
Plot an array of convex sets in two dimensions using an axis-aligned
approximation.
### Input
- `Xk` -- array of convex sets
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> B1 = BallInf(zeros(2), 0.4);
julia> B2 = BallInf(ones(2), 0.4);
julia> plot([B1, B2]);
```
### Algorithm
For each 2D lazy set in the array we compute its box overapproximation, followed
by the list of vertices. A post-processing `convex_hull` is applied to the vertices list;
this ensures that the shaded area inside the convex hull of the vertices is covered
correctly.
"""
@recipe function plot_lazyset(Xk::Vector{S};
seriescolor="blue", label="", grid=true,
alpha=0.5) where {S<:LazySet}
seriestype := :shape
for X in Xk
if X isa EmptySet
continue
end
@assert dim(X) == 2 "cannot plot a $(dim(X))-dimensional set"
Pi = Approximations.overapproximate(X)
vlist = transpose(hcat(convex_hull(vertices_list(Pi))...))
if isempty(vlist)
warn_empty_polytope()
continue
end
x, y = vlist[:, 1], vlist[:, 2]
# add first vertex to "close" the polygon
push!(x, vlist[1, 1])
push!(y, vlist[1, 2])
@series (x, y)
end
end
"""
plot_lazyset(S::LazySet, ε::Float64; ...)
Plot a lazy set in two dimensions using iterative refinement.
### Input
- `S` -- convex set
- `ε` -- approximation error bound
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> B = BallInf(ones(2), 0.1);
julia> plot(randn(2, 2) * B, 1e-3);
```
"""
@recipe function plot_lazyset(S::LazySet, ε::Float64;
color="blue", label="", grid=true, alpha=0.5)
@assert dim(S) == 2 "cannot plot a $(dim(S))-dimensional set"
seriestype := :shape
P = Approximations.overapproximate(S, ε)
vlist = transpose(hcat(vertices_list(P)...))
if isempty(vlist)
warn_empty_polytope()
return []
end
(x, y) = vlist[:, 1], vlist[:, 2]
# add first vertex to "close" the polygon
push!(x, vlist[1, 1])
push!(y, vlist[1, 2])
x, y
end
"""
plot_lazyset(Xk::Vector{S}, ε::Float64; ...) where {S<:LazySet}
Plot an array of lazy sets in two dimensions using iterative refinement.
### Input
- `Xk` -- array of convex sets
- `ε` -- approximation error bound
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> B1 = BallInf(zeros(2), 0.4);
julia> B2 = Ball2(ones(2), 0.4);
julia> plot([B1, B2], 1e-4);
```
"""
@recipe function plot_lazyset(Xk::Vector{S}, ε::Float64;
seriescolor="blue", label="", grid=true,
alpha=0.5) where {S<:LazySet}
seriestype := :shape
for X in Xk
if X isa EmptySet
continue
end
@assert dim(X) == 2 "cannot plot a $(dim(X))-dimensional set"
Pi = Approximations.overapproximate(X, ε)
vlist = transpose(hcat(vertices_list(Pi)...))
if isempty(vlist)
warn_empty_polytope()
continue
end
x, y = vlist[:, 1], vlist[:, 2]
# add first vertex to "close" the polygon
push!(x, vlist[1, 1])
push!(y, vlist[1, 2])
@series (x, y)
end
end
# ==============================
# Plot recipes for 2D polytopes
# ==============================
"""
plot_polygon(P::AbstractPolytope; ...)
Plot a 2D polytope as the convex hull of its vertices.
### Input
- `P` -- polygon or polytope
### Examples
```jldoctest plotting_polytope
julia> using Plots, LazySets;
julia> P = HPolygon([LinearConstraint([1.0, 0.0], 0.6),
LinearConstraint([0.0, 1.0], 0.6),
LinearConstraint([-1.0, 0.0], -0.4),
LinearConstraint([0.0, -1.0], -0.4)]);
julia> plot(P);
```
This recipe also applies if the polygon is given in vertex representation:
```jldoctest plotting_polytope
julia> P = VPolygon([[0.6, 0.6], [0.4, 0.6], [0.4, 0.4], [0.6, 0.4]]);
julia> plot(P);
```
"""
@recipe function plot_polytope(P::AbstractPolytope;
color="blue", label="", grid=true, alpha=0.5)
# for polytopes
@assert dim(P) == 2 "cannot plot a $(dim(P))-dimensional polytope"
seriestype := :shape
points = convex_hull(vertices_list(P))
vlist = transpose(hcat(points...))
if isempty(vlist)
warn_empty_polytope()
return []
end
(x, y) = vlist[:, 1], vlist[:, 2]
# add first vertex to "close" the polygon
push!(x, vlist[1, 1])
push!(y, vlist[1, 2])
x, y
end
"""
plot_polytopes(Xk::Vector{S}; ...)
Plot an array of 2D polytopes.
### Input
- `Xk` -- array of polytopes
### Examples
```jldoctest plotting_polytopes
julia> using Plots, LazySets;
julia> P1 = HPolygon([LinearConstraint([1.0, 0.0], 0.6),
LinearConstraint([0.0, 1.0], 0.6),
LinearConstraint([-1.0, 0.0], -0.4),
LinearConstraint([0.0, -1.0], -0.4)]);
julia> P2 = HPolygon([LinearConstraint([2.0, 0.0], 0.6),
LinearConstraint([0.0, 2.0], 0.6),
LinearConstraint([-2.0, 0.0], -0.4),
LinearConstraint([0.0, -2.0], -0.4)]);
julia> plot([P1, P2]);
```
```jldoctest plotting_polytopes
julia> P1 = VPolygon([[0.6, 0.6], [0.4, 0.6], [0.4, 0.4], [0.6, 0.4]]);
julia> P2 = VPolygon([[0.3, 0.3], [0.2, 0.3], [0.2, 0.2], [0.3, 0.2]]);
julia> plot([P1, P2]);
```
### Notes
It is assumed that the given vector of polytopes is two-dimensional.
"""
@recipe function plot_polytopes(Xk::Vector{S};
seriescolor="blue", label="", grid=true,
alpha=0.5) where {S<:AbstractPolytope}
# it is assumed that the polytopes are two-dimensional
seriestype := :shape
for Pi in Xk
@assert dim(Pi) == 2 "cannot plot a $(dim(Pi))-dimensional polytope"
points = convex_hull(vertices_list(Pi))
vlist = transpose(hcat(points...))
if isempty(vlist)
warn_empty_polytope()
continue
end
x, y = vlist[:, 1], vlist[:, 2]
# add first vertex to "close" the polygon
push!(x, vlist[1, 1])
push!(y, vlist[1, 2])
@series (x, y)
end
end
# ============================
# Plot recipes for singletons
# ============================
"""
plot_singleton(X::AbstractSingleton; ...)
Plot a singleton.
### Input
- `X` -- singleton, i.e., a one-element set
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> plot(Singleton([0.5, 1.0]));
```
"""
@recipe function plot_singleton(point::AbstractSingleton;
color="blue", label="", grid=true,
legend=false)
seriestype := :scatter
@assert dim(point) == 2 ||
dim(point) == 3 "cannot plot a $(dim(point))-dimensional singleton"
[Tuple(element(point))]
end
"""
plot_singleton(Xk::Vector{S}; ...) where {S<:AbstractSingleton}
Plot a list of singletons.
### Input
- `Xk` -- list of singletons, i.e., a vector of one-element sets
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> plot([Singleton([0.0, 0.0]), Singleton([1., 0]), Singleton([0.5, .5])]);
```
Three-dimensional singletons can be plotted as well:
```jldoctest
julia> using Plots, LazySets;
julia> a, b, c = zeros(3), [1.0, 0, 0], [0.0, 1., 0];
julia> plot([Singleton(a), Singleton(b), Singleton(c)]);
```
"""
@recipe function plot_singleton(Xk::Vector{S};
color="blue", label="", grid=true, legend=false
) where {S<:AbstractSingleton}
seriestype := :scatter
if dim(Xk[1]) == 2
@assert all([dim(pi) == 2 for pi in Xk]) "all points in this vector " *
"should have the same dimension"
elseif dim(Xk[1]) == 3
@assert all([dim(pi) == 3 for pi in Xk]) "all points in this vector " *
"should have the same dimension"
else
error("can only plot 2D or 3D vectors of singletons")
end
[Tuple(element(point)) for point in Xk]
end
# =====================================
# Plot recipes for lines and intervals
# =====================================
"""
plot_linesegment(L::LineSegment; ...)
Plot a line segment.
### Input
- `L` -- line segment
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> L = LineSegment([0., 0.], [1., 1.]);
julia> plot(L);
```
"""
@recipe function plot_linesegment(L::LineSegment; color="blue", label="",
grid=true, alpha=0.5, legend=false,
add_marker=true)
seriestype := :path
linecolor --> color
markershape --> (add_marker ? :circle : :none)
markercolor --> color
[Tuple(L.p); Tuple(L.q)]
end
"""
plot_linesegments(Xk::Vector{S}; ...) where {S<:LineSegment}
Plot an array of line segments.
### Input
- `Xk` -- linear array of line segments
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> L1 = LineSegment([0., 0.], [1., 1.]);
julia> L2 = LineSegment([1., 0.], [0., 1.]);
julia> plot([L1, L2]);
```
"""
@recipe function plot_linesegments(Xk::Vector{S}; color="blue",
label="", grid=true, alpha=0.5, legend=false,
add_marker=true) where {S<:LineSegment}
seriestype := :path
linecolor --> color
markershape --> (add_marker ? :circle : :none)
markercolor --> color
for Li in Xk
@series [Tuple(Li.p); Tuple(Li.q)]
end
end
"""
plot_interval(I::Interval; ...)
Plot an interval.
### Input
- `I` -- interval
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> I = Interval(0.0, 1.0);
julia> plot(I);
```
"""
@recipe function plot_interval(I::Interval; color=:auto, label="", grid=true,
alpha=0.5, legend=false, add_marker=true,
linewidth=2.)
seriestype := :path
linecolor --> color
markershape --> (add_marker ? :circle : :none)
markercolor --> color
[Tuple([min(I), 0.0]); Tuple([max(I), 0.0])]
end
"""
plot_intervals(Xk::Vector{S}; ...) where {S<:Interval}
Plot an array of intervals.
### Input
- `Xk` -- linear array of intervals
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> I1 = Interval([0., 1.]);
julia> I2 = Interval([0.5, 2.]);
julia> plot([I1, I2]);
```
"""
@recipe function plot_intervals(Xk::Vector{S}; color=:auto, label="", grid=true,
alpha=0.5, legend=false, add_marker=true,
linewidth=2.0) where {S<:Interval}
seriestype := :path
linecolor --> color
markershape --> (add_marker ? :circle : :none)
markercolor --> color
for Ii in Xk
@series [Tuple([min(Ii), 0.0]); Tuple([max(Ii), 0.0])]
end
end
# ==============================
# Plot recipe for the empty set
# ==============================
"""
plot_emptyset(∅::EmptySet, [ε::Float64=0.0]; ...)
Plot an empty set.
### Input
- `∅` -- empty set
- `ε` -- (optional, default: `0.0`) approximation error bound
### Examples
```jldoctest
julia> using Plots, LazySets;
julia> plot(∅);
julia> plot(∅, 1e-2);
```
"""
@recipe function plot_emptyset(∅::EmptySet, ε::Float64=0.0; label="", grid=true,
legend=false)
return []
end