Skip to content

Add kamenev for polytope approximations#4272

Open
maartenvd wants to merge 1 commit intoJuliaReach:masterfrom
maartenvd:master
Open

Add kamenev for polytope approximations#4272
maartenvd wants to merge 1 commit intoJuliaReach:masterfrom
maartenvd:master

Conversation

@maartenvd
Copy link
Copy Markdown

As mentioned in #969 , a simple algorithm to approximate lazysets by a polytope.

Copy link
Copy Markdown
Member

@schillic schillic left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Looks good to me, thanks! Two minor suggestions only (assuming that the tests pass).

Comment on lines +13 to +16
@test inner2 isa VPolytope

outer2 = overapproximate(B, HPolytope, tol)
@test outer2 isa HPolytope
Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
@test inner2 isa VPolytope
outer2 = overapproximate(B, HPolytope, tol)
@test outer2 isa HPolytope
@test inner2 == inner
outer2 = overapproximate(B, HPolytope, tol)
@test outer2 == outer

This should hold, right?

inner_V = VPolytope(inner_V.vertices)
inner_H = convert(HPolytope,inner_V) # this isn't ideal. inner_H was still largely correct

outer = concretize(outer ∩ HalfSpace(worst_face.a,ρ(worst_face.a,S)))
Copy link
Copy Markdown
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
outer = concretize(outer HalfSpace(worst_face.a,ρ(worst_face.a,S)))
outer = intersection(outer, HalfSpace(worst_face.a,ρ(worst_face.a,S)))

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants