Concrete class to compute the collapse cost of each edge in a mesh as the memoryless variant of QEM error (Quadric Error Metric).
More...
|
using | vertex_descriptor = typename boost::graph_traits< HalfedgeGraph >::vertex_descriptor |
|
using | halfedge_descriptor = typename boost::graph_traits< HalfedgeGraph >::halfedge_descriptor |
|
using | edge_iterator = typename boost::graph_traits< HalfedgeGraph >::edge_iterator |
|
using | edge_descriptor = typename boost::graph_traits< HalfedgeGraph >::edge_descriptor |
|
using | face_descriptor = typename boost::graph_traits< HalfedgeGraph >::face_descriptor |
|
using | Vector = typename FEVV::Geometry_traits< HalfedgeGraph >::Vector |
|
using | Point = typename FEVV::Geometry_traits< HalfedgeGraph >::Point |
|
using | Geometry = typename FEVV::Geometry_traits< HalfedgeGraph > |
|
typedef Error_metric< HalfedgeGraph, PointMap > | Super_class |
|
typedef Eigen::MatrixXd | Matrix |
|
typedef Eigen::VectorXd | VectorX |
|
typedef std::tuple< Matrix, VectorX, double > | Quadric |
|
using | vertex_descriptor = typename boost::graph_traits< HalfedgeGraph >::vertex_descriptor |
|
using | halfedge_descriptor = typename boost::graph_traits< HalfedgeGraph >::halfedge_descriptor |
|
using | edge_iterator = typename boost::graph_traits< HalfedgeGraph >::edge_iterator |
|
using | edge_descriptor = typename boost::graph_traits< HalfedgeGraph >::edge_descriptor |
|
using | Vector = typename FEVV::Geometry_traits< HalfedgeGraph >::Vector |
|
using | Point = typename FEVV::Geometry_traits< HalfedgeGraph >::Point |
|
using | Geometry = typename FEVV::Geometry_traits< HalfedgeGraph > |
|
typedef std::priority_queue< std::tuple< edge_descriptor, double, Point >, std::vector< std::tuple< edge_descriptor, double, Point > >, Compare_weights2< HalfedgeGraph > > | priority_queue_edges |
|
typedef std::map< edge_descriptor, std::pair< double, Point > > | edge2cost_map |
|
|
| QEM_3D (HalfedgeGraph &g, PointMap &pm, Kept_position< HalfedgeGraph, PointMap > *vkept, FEVV::Filters::Uniform_dequantization< HalfedgeGraph, PointMap > &dequantiz) |
|
| ~QEM_3D () |
|
virtual void | compute_error () override |
|
double | compute_cost_edge (edge_descriptor e, const Point &collapsePos) override |
|
std::string | get_as_string () const override |
|
| Error_metric (HalfedgeGraph &g, PointMap &pm, Kept_position< HalfedgeGraph, PointMap > *vkept, FEVV::Filters::Uniform_dequantization< HalfedgeGraph, PointMap > &dequantiz) |
|
virtual | ~Error_metric () |
|
bool | is_queue_empty () |
|
std::tuple< typename boost::graph_traits< HalfedgeGraph >::edge_descriptor, double, typename Geometry::Point > | get_top_queue () const |
|
void | pop_queue () |
|
double | get_top_cost () const |
|
double | get_mean_threshold () const |
|
void | delete_from_descriptors (edge_descriptor e) |
|
bool | is_present_in_map (edge_descriptor e) const |
|
void | remove_old_edges (vertex_descriptor vs, vertex_descriptor vt) |
|
size_t | get_size_queue () const |
|
Kept_position< HalfedgeGraph, PointMap > * | get_vkept () |
|
template<typename HalfedgeGraph, typename PointMap>
class FEVV::Filters::QEM_3D< HalfedgeGraph, PointMap >
Concrete class to compute the collapse cost of each edge in a mesh as the memoryless variant of QEM error (Quadric Error Metric).
Definition at line 27 of file QEM_3D.h.