273 lines
8.8 KiB
C++
273 lines
8.8 KiB
C++
|
/*===========================================================================*\
|
||
|
|
* *
|
||
|
|
* OpenMesh *
|
||
|
|
* Copyright (C) 2001-2011 by Computer Graphics Group, RWTH Aachen *
|
||
|
|
* www.openmesh.org *
|
||
|
|
* *
|
||
|
|
*---------------------------------------------------------------------------*
|
||
|
|
* This file is part of OpenMesh. *
|
||
|
|
* *
|
||
|
|
* OpenMesh is free software: you can redistribute it and/or modify *
|
||
|
|
* it under the terms of the GNU Lesser General Public License as *
|
||
|
|
* published by the Free Software Foundation, either version 3 of *
|
||
|
|
* the License, or (at your option) any later version with the *
|
||
|
|
* following exceptions: *
|
||
|
|
* *
|
||
|
|
* If other files instantiate templates or use macros *
|
||
|
|
* or inline functions from this file, or you compile this file and *
|
||
|
|
* link it with other files to produce an executable, this file does *
|
||
|
|
* not by itself cause the resulting executable to be covered by the *
|
||
|
|
* GNU Lesser General Public License. This exception does not however *
|
||
|
|
* invalidate any other reasons why the executable file might be *
|
||
|
|
* covered by the GNU Lesser General Public License. *
|
||
|
|
* *
|
||
|
|
* OpenMesh is distributed in the hope that it will be useful, *
|
||
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
|
||
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
|
||
|
|
* GNU Lesser General Public License for more details. *
|
||
|
|
* *
|
||
|
|
* You should have received a copy of the GNU LesserGeneral Public *
|
||
|
|
* License along with OpenMesh. If not, *
|
||
|
|
* see <http://www.gnu.org/licenses/>. *
|
||
|
|
* *
|
||
|
|
\*===========================================================================*/
|
||
|
|
|
||
|
|
/*===========================================================================*\
|
||
|
|
* *
|
||
|
|
* $Revision: 448 $ *
|
||
|
|
* $Date: 2011-11-04 13:59:37 +0100 (Fri, 04 Nov 2011) $ *
|
||
|
|
* *
|
||
|
|
\*===========================================================================*/
|
||
|
|
|
||
|
|
/** \file ModHausdorffT.cc
|
||
|
|
*/
|
||
|
|
|
||
|
|
|
||
|
|
//=============================================================================
|
||
|
|
//
|
||
|
|
// CLASS ModHausdorffT - IMPLEMENTATION
|
||
|
|
//
|
||
|
|
//=============================================================================
|
||
|
|
|
||
|
|
#define MB_MODHAUSDORFFT_C
|
||
|
|
|
||
|
|
|
||
|
|
//== INCLUDES =================================================================
|
||
|
|
|
||
|
|
#include "ModHausdorffT.hh"
|
||
|
|
#include <ACG/Geometry/Algorithms.hh>
|
||
|
|
|
||
|
|
|
||
|
|
//== NAMESPACES ===============================================================
|
||
|
|
|
||
|
|
namespace OpenMesh {
|
||
|
|
namespace Decimater {
|
||
|
|
|
||
|
|
|
||
|
|
//== IMPLEMENTATION ==========================================================
|
||
|
|
|
||
|
|
|
||
|
|
template <class DecimaterT>
|
||
|
|
void
|
||
|
|
ModHausdorffT<DecimaterT>::
|
||
|
|
initialize()
|
||
|
|
{
|
||
|
|
typename Mesh::FIter f_it(mesh_.faces_begin()), f_end(mesh_.faces_end());
|
||
|
|
|
||
|
|
for (; f_it!=f_end; ++f_it)
|
||
|
|
mesh_.property(points_, f_it).clear();
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
//-----------------------------------------------------------------------------
|
||
|
|
|
||
|
|
|
||
|
|
template <class DecimaterT>
|
||
|
|
float
|
||
|
|
ModHausdorffT<DecimaterT>::
|
||
|
|
collapse_priority(const CollapseInfo& _ci)
|
||
|
|
{
|
||
|
|
static Points points; points.clear();
|
||
|
|
std::vector<FaceHandle> faces; faces.reserve(20);
|
||
|
|
typename Mesh::VertexFaceIter vf_it;
|
||
|
|
typename Mesh::FaceHandle fh;
|
||
|
|
typename Mesh::Scalar sqr_tolerace = tolerance_*tolerance_;
|
||
|
|
typename Mesh::Point dummy;
|
||
|
|
typename Mesh::CFVIter fv_it;
|
||
|
|
bool ok;
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// collect all points to be tested
|
||
|
|
// collect all faces to be tested against
|
||
|
|
for (vf_it=mesh_.vf_iter(_ci.v0); vf_it; ++vf_it) {
|
||
|
|
fh = vf_it.handle();
|
||
|
|
|
||
|
|
if (fh != _ci.fl && fh != _ci.fr)
|
||
|
|
faces.push_back(fh);
|
||
|
|
|
||
|
|
Points& pts = mesh_.property(points_, fh);
|
||
|
|
std::copy(pts.begin(), pts.end(), std::back_inserter(points));
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
// add point to be removed
|
||
|
|
points.push_back(_ci.p0);
|
||
|
|
|
||
|
|
|
||
|
|
// setup iterators
|
||
|
|
typename std::vector<FaceHandle>::iterator fh_it, fh_end(faces.end());
|
||
|
|
typename Points::const_iterator p_it, p_end(points.end());
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// simulate collapse
|
||
|
|
mesh_.set_point(_ci.v0, _ci.p1);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// for each point: try to find a face such that error is < tolerance
|
||
|
|
ok = true;
|
||
|
|
for (p_it=points.begin(); ok && p_it!=p_end; ++p_it) {
|
||
|
|
ok = false;
|
||
|
|
|
||
|
|
for (fh_it=faces.begin(); !ok && fh_it!=fh_end; ++fh_it) {
|
||
|
|
const Point& p0 = mesh_.point(fv_it=mesh_.cfv_iter(*fh_it));
|
||
|
|
const Point& p1 = mesh_.point(++fv_it);
|
||
|
|
const Point& p2 = mesh_.point(++fv_it);
|
||
|
|
|
||
|
|
if ( ACG::Geometry::distPointTriangleSquared(*p_it, p0, p1, p2, dummy) <= sqr_tolerace)
|
||
|
|
ok = true;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// undo simulation changes
|
||
|
|
mesh_.set_point(_ci.v0, _ci.p0);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
return ( ok ? Base::LEGAL_COLLAPSE : Base::ILLEGAL_COLLAPSE );
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
//-----------------------------------------------------------------------------
|
||
|
|
|
||
|
|
|
||
|
|
template <class DecimaterT>
|
||
|
|
void
|
||
|
|
ModHausdorffT<DecimaterT>::
|
||
|
|
postprocess_collapse(const CollapseInfo& _ci)
|
||
|
|
{
|
||
|
|
static Points points;
|
||
|
|
typename Mesh::VertexFaceIter vf_it;
|
||
|
|
FaceHandle fh;
|
||
|
|
std::vector<FaceHandle> faces;
|
||
|
|
|
||
|
|
|
||
|
|
// collect points & neighboring triangles
|
||
|
|
|
||
|
|
points.clear(); // it's static !
|
||
|
|
faces.reserve(20);
|
||
|
|
|
||
|
|
|
||
|
|
// collect active faces and their points
|
||
|
|
for (vf_it=mesh_.vf_iter(_ci.v1); vf_it; ++vf_it) {
|
||
|
|
fh = vf_it.handle();
|
||
|
|
faces.push_back(fh);
|
||
|
|
|
||
|
|
Points& pts = mesh_.property(points_, fh);
|
||
|
|
std::copy(pts.begin(), pts.end(), std::back_inserter(points));
|
||
|
|
pts.clear();
|
||
|
|
}
|
||
|
|
if (faces.empty()) return; // should not happen anyway...
|
||
|
|
|
||
|
|
|
||
|
|
// collect points of the 2 deleted faces
|
||
|
|
if ((fh=_ci.fl).is_valid()) {
|
||
|
|
Points& pts = mesh_.property(points_, fh);
|
||
|
|
std::copy(pts.begin(), pts.end(), std::back_inserter(points));
|
||
|
|
pts.clear();
|
||
|
|
}
|
||
|
|
if ((fh=_ci.fr).is_valid()) {
|
||
|
|
Points& pts = mesh_.property(points_, fh);
|
||
|
|
std::copy(pts.begin(), pts.end(), std::back_inserter(points));
|
||
|
|
pts.clear();
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
// add the deleted point
|
||
|
|
points.push_back(_ci.p0);
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// setup iterators
|
||
|
|
typename std::vector<FaceHandle>::iterator fh_it, fh_end(faces.end());
|
||
|
|
typename Points::const_iterator p_it, p_end(points.end());
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
// re-distribute points
|
||
|
|
Scalar emin, e;
|
||
|
|
Point dummy;
|
||
|
|
typename Mesh::CFVIter fv_it;
|
||
|
|
|
||
|
|
for (p_it=points.begin(); p_it!=p_end; ++p_it) {
|
||
|
|
emin = FLT_MAX;
|
||
|
|
|
||
|
|
for (fh_it=faces.begin(); fh_it!=fh_end; ++fh_it) {
|
||
|
|
const Point& p0 = mesh_.point(fv_it=mesh_.cfv_iter(*fh_it));
|
||
|
|
const Point& p1 = mesh_.point(++fv_it);
|
||
|
|
const Point& p2 = mesh_.point(++fv_it);
|
||
|
|
|
||
|
|
e = ACG::Geometry::distPointTriangleSquared(*p_it, p0, p1, p2, dummy);
|
||
|
|
if (e < emin) {
|
||
|
|
emin = e;
|
||
|
|
fh = *fh_it;
|
||
|
|
}
|
||
|
|
|
||
|
|
}
|
||
|
|
|
||
|
|
mesh_.property(points_, fh).push_back(*p_it);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
//-----------------------------------------------------------------------------
|
||
|
|
|
||
|
|
|
||
|
|
template <class DecimaterT>
|
||
|
|
typename ModHausdorffT<DecimaterT>::Scalar
|
||
|
|
ModHausdorffT<DecimaterT>::
|
||
|
|
compute_sqr_error(FaceHandle _fh, const Point& _p) const
|
||
|
|
{
|
||
|
|
typename Mesh::CFVIter fv_it = mesh_.cfv_iter(_fh);
|
||
|
|
const Point& p0 = mesh_.point(fv_it);
|
||
|
|
const Point& p1 = mesh_.point(++fv_it);
|
||
|
|
const Point& p2 = mesh_.point(++fv_it);
|
||
|
|
|
||
|
|
const Points& points = mesh_.property(points_, _fh);
|
||
|
|
typename Points::const_iterator p_it = points.begin();
|
||
|
|
typename Points::const_iterator p_end = points.end();
|
||
|
|
|
||
|
|
Point dummy;
|
||
|
|
Scalar e;
|
||
|
|
Scalar emax = ACG::Geometry::distPointTriangleSquared(_p, p0, p1, p2, dummy);
|
||
|
|
|
||
|
|
for (; p_it!=p_end; ++p_it) {
|
||
|
|
e = ACG::Geometry::distPointTriangleSquared(*p_it, p0, p1, p2, dummy);
|
||
|
|
if (e > emax)
|
||
|
|
emax = e;
|
||
|
|
}
|
||
|
|
|
||
|
|
return emax;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
//=============================================================================
|
||
|
|
}
|
||
|
|
}
|
||
|
|
//=============================================================================
|