|
Drake
|
|
Drake
|
This is the complete list of members for HPolyhedron, including all inherited members.
| A() const | HPolyhedron | |
| AddPointInNonnegativeScalingConstraints(solvers::MathematicalProgram *prog, const Eigen::Ref< const solvers::VectorXDecisionVariable > &x, const symbolic::Variable &t) const | ConvexSet | |
| AddPointInNonnegativeScalingConstraints(solvers::MathematicalProgram *prog, const Eigen::Ref< const Eigen::MatrixXd > &A, const Eigen::Ref< const Eigen::VectorXd > &b, const Eigen::Ref< const Eigen::VectorXd > &c, double d, const Eigen::Ref< const solvers::VectorXDecisionVariable > &x, const Eigen::Ref< const solvers::VectorXDecisionVariable > &t) const | ConvexSet | |
| AddPointInSetConstraints(solvers::MathematicalProgram *prog, const Eigen::Ref< const solvers::VectorXDecisionVariable > &vars) const | ConvexSet | |
| AffineHullShortcut(const ConvexSet &self, std::optional< double > tol) | ConvexSet | protectedstatic |
| ambient_dimension() const | ConvexSet | |
| b() const | HPolyhedron | |
| CalcVolume() const | HPolyhedron | |
| drake::geometry::optimization::ConvexSet::CalcVolume() const | ConvexSet | |
| CalcVolumeViaSampling(RandomGenerator *generator, const double desired_rel_accuracy=1e-2, const int max_num_samples=1e4) const | ConvexSet | |
| CartesianPower(int n) const | HPolyhedron | |
| CartesianProduct(const HPolyhedron &other) const | HPolyhedron | |
| ChebyshevCenter() const | HPolyhedron | |
| Clone() const | ConvexSet | |
| ContainedIn(const HPolyhedron &other, double tol=1E-9) const | HPolyhedron | |
| ConvexSet(const ConvexSet &)=default | ConvexSet | protected |
| ConvexSet(ConvexSet &&)=default | ConvexSet | protected |
| ConvexSet(int ambient_dimension, bool has_exact_volume) | ConvexSet | explicitprotected |
| DoAffineHullShortcut(std::optional< double > tol) const | ConvexSet | protectedvirtual |
| DoCalcVolume() const | ConvexSet | protectedvirtual |
| DoIsBoundedShortcutParallel(Parallelism) const | ConvexSet | protectedvirtual |
| DoMaybeGetFeasiblePoint() const | ConvexSet | protectedvirtual |
| DoMaybeGetPoint() const | ConvexSet | protectedvirtual |
| DoPointInSet(const Eigen::Ref< const Eigen::VectorXd > &x, double tol) const | ConvexSet | protectedvirtual |
| DoProjectionShortcut(const Eigen::Ref< const Eigen::MatrixXd > &points, EigenPtr< Eigen::MatrixXd > projected_points) const | ConvexSet | protectedvirtual |
| FindRedundant(double tol=1E-9) const | HPolyhedron | |
| HandleZeroAmbientDimensionConstraints(solvers::MathematicalProgram *prog, const ConvexSet &set, std::vector< solvers::Binding< solvers::Constraint >> *constraints) const | ConvexSet | protected |
| has_exact_volume() const | ConvexSet | |
| HPolyhedron(const HPolyhedron &)=default | HPolyhedron | |
| HPolyhedron(HPolyhedron &&)=default | HPolyhedron | |
| HPolyhedron() | HPolyhedron | |
| HPolyhedron(const Eigen::Ref< const Eigen::MatrixXd > &A, const Eigen::Ref< const Eigen::VectorXd > &b) | HPolyhedron | |
| HPolyhedron(const QueryObject< double > &query_object, GeometryId geometry_id, std::optional< FrameId > reference_frame=std::nullopt) | HPolyhedron | |
| HPolyhedron(const VPolytope &vpoly, double tol=1e-9) | HPolyhedron | explicit |
| HPolyhedron(const solvers::MathematicalProgram &prog) | HPolyhedron | explicit |
| Intersection(const HPolyhedron &other, bool check_for_redundancy=false, double tol=1E-9) const | HPolyhedron | |
| IntersectsWith(const ConvexSet &other) const | ConvexSet | |
| IsBounded(Parallelism parallelism=Parallelism::None()) const | HPolyhedron | |
| drake::geometry::optimization::ConvexSet::IsBounded(Parallelism parallelism=Parallelism::None()) const | ConvexSet | |
| IsEmpty() const | ConvexSet | |
| MakeBox(const Eigen::Ref< const Eigen::VectorXd > &lb, const Eigen::Ref< const Eigen::VectorXd > &ub) | HPolyhedron | static |
| MakeL1Ball(int dim) | HPolyhedron | static |
| MakeUnitBox(int dim) | HPolyhedron | static |
| MaximumVolumeInscribedAffineTransformation(const HPolyhedron &circumbody) const | HPolyhedron | |
| MaximumVolumeInscribedEllipsoid() const | HPolyhedron | |
| MaybeGetFeasiblePoint() const | ConvexSet | |
| MaybeGetPoint() const | ConvexSet | |
| operator=(const HPolyhedron &)=default | HPolyhedron | |
| operator=(HPolyhedron &&)=default | HPolyhedron | |
| drake::geometry::optimization::ConvexSet::operator=(const ConvexSet &)=default | ConvexSet | protected |
| drake::geometry::optimization::ConvexSet::operator=(ConvexSet &&)=default | ConvexSet | protected |
| PointInSet(const Eigen::Ref< const Eigen::VectorXd > &x, double tol=0) const | ConvexSet | |
| PontryaginDifference(const HPolyhedron &other) const | HPolyhedron | |
| Projection(const Eigen::Ref< const Eigen::MatrixXd > &points) const | ConvexSet | |
| ReduceInequalities(double tol=1E-9) const | HPolyhedron | |
| Scale(double scale, std::optional< Eigen::VectorXd > center=std::nullopt) const | HPolyhedron | |
| Serialize(Archive *a) | HPolyhedron | |
| SimplifyByIncrementalFaceTranslation(double min_volume_ratio=0.1, bool do_affine_transformation=true, int max_iterations=10, const Eigen::MatrixXd &points_to_contain=Eigen::MatrixXd(), const std::vector< drake::geometry::optimization::HPolyhedron > &intersecting_polytopes=std::vector< HPolyhedron >(), bool keep_whole_intersection=false, double intersection_padding=1e-4, int random_seed=0) const | HPolyhedron | |
| ToShapeWithPose() const | ConvexSet | |
| UniformSample(RandomGenerator *generator, const Eigen::Ref< const Eigen::VectorXd > &previous_sample, int mixing_steps=10, const std::optional< Eigen::Ref< const Eigen::MatrixXd >> &subspace=std::nullopt, double tol=1e-8) const | HPolyhedron | |
| UniformSample(RandomGenerator *generator, int mixing_steps=10, const std::optional< Eigen::Ref< const Eigen::MatrixXd >> &subspace=std::nullopt, double tol=1e-8) const | HPolyhedron | |
| ~ConvexSet() | ConvexSet | virtual |
| ~HPolyhedron() final | HPolyhedron |