|
ellipsoid_tree 0.1.0
Exact intersection tests for ellipsoids and friends
|
Simplex conv(V.col(0), ..., V.col(K-1)): K vertices in R^dim, K <= dim+1. More...
#include <ellipsoid_tree/geometry.hpp>
Public Attributes | |
| Eigen::MatrixXd | V |
| Vertices, shape (dim, K); columns are the vertices. | |
Simplex conv(V.col(0), ..., V.col(K-1)): K vertices in R^dim, K <= dim+1.
K == dim+1 gives a full-dimensional simplex; smaller K gives a lower-dimensional simplex (point, segment, triangle, ...) embedded in R^dim.
| Eigen::MatrixXd ellipsoid_tree::Simplex::V |
Vertices, shape (dim, K); columns are the vertices.