<html>
<head>
<meta content="text/html; charset=windows-1252"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<p>The PPL implements the following function:<br>
</p>
<p>bool<br>
check_containment(const NNC_Polyhedron& ph,<br>
const
Pointset_Powerset<NNC_Polyhedron>& ps);<br>
</p>
<p>It returns true iff ph is contained in the union of the polyhedra
in ps.<br>
</p>
<p>There also is a variant where the argument polyhedra are
topologically closed, but the underlying implementation will
anyway resort to using NNC_Polyhedron.<br>
</p>
Regards,<br>
Enea Zaffanella.<br>
<br>
<div class="moz-cite-prefix">On 01/23/2017 06:59 AM, HazelM wrote:<br>
</div>
<blockquote
cite="mid:CABpPoKguSy-=x-Y_un0WfromDjkS9xW5Qb_9wFRMAZQ=iOLSbQ@mail.gmail.com"
type="cite">
<div dir="ltr">Hi, I've been trying to merge or perform union on
polytopes using poly_hull_assign and upper_bound_assign, but
they return poly hull of the resulting polytopes. For my use it
would not give accurate results. difference_assign also returns
a poly hull. Is there a way that I can find out containment of a
polytope in multiple polytopes? Your help would be highly
appreciated.<br>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
PPL-devel mailing list
<a class="moz-txt-link-abbreviated" href="mailto:PPL-devel@cs.unipr.it">PPL-devel@cs.unipr.it</a>
<a class="moz-txt-link-freetext" href="http://www.cs.unipr.it/mailman/listinfo/ppl-devel">http://www.cs.unipr.it/mailman/listinfo/ppl-devel</a>
</pre>
</blockquote>
<br>
</body>
</html>