|
315 | 315 | <tr id="row_0_4_1_15_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_hyperellipsoid.html" target="_self">Hyperellipsoid</a></td><td class="desc">Implements an ellipsoidal convex set represented by the quadratic form <code>{x | (x-center)ᵀAᵀA(x-center) ≤ 1}</code> </td></tr> |
316 | 316 | <tr id="row_0_4_1_16_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_hyperrectangle.html" target="_self">Hyperrectangle</a></td><td class="desc">Axis-aligned hyperrectangle in Rᵈ defined by its lower bounds and upper bounds as {x| lb ≤ x ≤ ub} </td></tr> |
317 | 317 | <tr id="row_0_4_1_17_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_implicit_graph_of_convex_sets.html" target="_self">ImplicitGraphOfConvexSets</a></td><td class="desc">A base class to define the interface to an implicit graph of convex sets </td></tr> |
318 | | -<tr id="row_0_4_1_18_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_intersection.html" target="_self">Intersection</a></td><td class="desc">A convex set that represents the intersection of multiple sets: S = X₁ ∩ X₂ ∩ .. </td></tr> |
319 | | -<tr id="row_0_4_1_19_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_iris_options.html" target="_self">IrisOptions</a></td><td class="desc">Configuration options for the IRIS algorithm </td></tr> |
320 | | -<tr id="row_0_4_1_20_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_minkowski_sum.html" target="_self">MinkowskiSum</a></td><td class="desc">A convex set that represents the Minkowski sum of multiple sets: S = X₁ ⨁ X₂ ⨁ .. </td></tr> |
321 | | -<tr id="row_0_4_1_21_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_plane_separates_geometries.html" target="_self">PlaneSeparatesGeometries</a></td><td class="desc">Contains the information to enforce a pair of geometries are separated by a plane </td></tr> |
322 | | -<tr id="row_0_4_1_22_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_point.html" target="_self">Point</a></td><td class="desc">A convex set that contains exactly one element </td></tr> |
323 | | -<tr id="row_0_4_1_23_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_sampled_volume.html" target="_self">SampledVolume</a></td><td class="desc">The result of a volume calculation from CalcVolumeViaSampling() </td></tr> |
324 | | -<tr id="row_0_4_1_24_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_separation_certificate_program_base.html" target="_self">SeparationCertificateProgramBase</a></td><td class="desc"></td></tr> |
325 | | -<tr id="row_0_4_1_25_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_separation_certificate_result_base.html" target="_self">SeparationCertificateResultBase</a></td><td class="desc">We certify that a pair of geometries is collision free by finding the separating plane over a range of configuration </td></tr> |
326 | | -<tr id="row_0_4_1_26_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_spectrahedron.html" target="_self">Spectrahedron</a></td><td class="desc">Implements a spectrahedron (the feasible set of a semidefinite program) </td></tr> |
327 | | -<tr id="row_0_4_1_27_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_v_polytope.html" target="_self">VPolytope</a></td><td class="desc">A polytope described using the vertex representation </td></tr> |
| 318 | +<tr id="row_0_4_1_18_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_implicit_graph_of_convex_sets_from_explicit.html" target="_self">ImplicitGraphOfConvexSetsFromExplicit</a></td><td class="desc">Provides an implicit GCS interface given an explicit GCS </td></tr> |
| 319 | +<tr id="row_0_4_1_19_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_intersection.html" target="_self">Intersection</a></td><td class="desc">A convex set that represents the intersection of multiple sets: S = X₁ ∩ X₂ ∩ .. </td></tr> |
| 320 | +<tr id="row_0_4_1_20_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_iris_options.html" target="_self">IrisOptions</a></td><td class="desc">Configuration options for the IRIS algorithm </td></tr> |
| 321 | +<tr id="row_0_4_1_21_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_minkowski_sum.html" target="_self">MinkowskiSum</a></td><td class="desc">A convex set that represents the Minkowski sum of multiple sets: S = X₁ ⨁ X₂ ⨁ .. </td></tr> |
| 322 | +<tr id="row_0_4_1_22_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_plane_separates_geometries.html" target="_self">PlaneSeparatesGeometries</a></td><td class="desc">Contains the information to enforce a pair of geometries are separated by a plane </td></tr> |
| 323 | +<tr id="row_0_4_1_23_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_point.html" target="_self">Point</a></td><td class="desc">A convex set that contains exactly one element </td></tr> |
| 324 | +<tr id="row_0_4_1_24_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_sampled_volume.html" target="_self">SampledVolume</a></td><td class="desc">The result of a volume calculation from CalcVolumeViaSampling() </td></tr> |
| 325 | +<tr id="row_0_4_1_25_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_separation_certificate_program_base.html" target="_self">SeparationCertificateProgramBase</a></td><td class="desc"></td></tr> |
| 326 | +<tr id="row_0_4_1_26_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="structdrake_1_1geometry_1_1optimization_1_1_separation_certificate_result_base.html" target="_self">SeparationCertificateResultBase</a></td><td class="desc">We certify that a pair of geometries is collision free by finding the separating plane over a range of configuration </td></tr> |
| 327 | +<tr id="row_0_4_1_27_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_spectrahedron.html" target="_self">Spectrahedron</a></td><td class="desc">Implements a spectrahedron (the feasible set of a semidefinite program) </td></tr> |
| 328 | +<tr id="row_0_4_1_28_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1optimization_1_1_v_polytope.html" target="_self">VPolytope</a></td><td class="desc">A polytope described using the vertex representation </td></tr> |
328 | 329 | <tr id="row_0_4_2_" style="display:none;"><td class="entry"><span style="width:32px;display:inline-block;"> </span><span id="arr_0_4_2_" class="arrow" onclick="toggleFolder('0_4_2_')">►</span><span class="icona"><span class="icon">N</span></span><a class="el" href="namespacedrake_1_1geometry_1_1render.html" target="_self">render</a></td><td class="desc"></td></tr> |
329 | 330 | <tr id="row_0_4_2_0_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1render_1_1_clipping_range.html" target="_self">ClippingRange</a></td><td class="desc">Defines the near and far clipping planes for frustum-based (OpenGL) <a class="el" href="classdrake_1_1geometry_1_1render_1_1_render_engine.html" title="The engine for performing rasterization operations on geometry.">RenderEngine</a> cameras </td></tr> |
330 | 331 | <tr id="row_0_4_2_1_" style="display:none;"><td class="entry"><span style="width:64px;display:inline-block;"> </span><span class="icona"><span class="icon">C</span></span><a class="el" href="classdrake_1_1geometry_1_1render_1_1_color_render_camera.html" target="_self">ColorRenderCamera</a></td><td class="desc">Collection of camera properties for cameras to be used with color/label images </td></tr> |
|
0 commit comments