fd4bcb39ea
git-svn-id: http://www.openmesh.org/svnrepo/OpenMesh/trunk@1258 fdac6126-5c0c-442c-9429-916003d36597
316 lines
12 KiB
C++
316 lines
12 KiB
C++
/* ========================================================================= *
|
|
* *
|
|
* OpenMesh *
|
|
* Copyright (c) 2001-2015, RWTH-Aachen University *
|
|
* Department of Computer Graphics and Multimedia *
|
|
* All rights reserved. *
|
|
* www.openmesh.org *
|
|
* *
|
|
*---------------------------------------------------------------------------*
|
|
* This file is part of OpenMesh. *
|
|
*---------------------------------------------------------------------------*
|
|
* *
|
|
* Redistribution and use in source and binary forms, with or without *
|
|
* modification, are permitted provided that the following conditions *
|
|
* are met: *
|
|
* *
|
|
* 1. Redistributions of source code must retain the above copyright notice, *
|
|
* this list of conditions and the following disclaimer. *
|
|
* *
|
|
* 2. Redistributions in binary form must reproduce the above copyright *
|
|
* notice, this list of conditions and the following disclaimer in the *
|
|
* documentation and/or other materials provided with the distribution. *
|
|
* *
|
|
* 3. Neither the name of the copyright holder nor the names of its *
|
|
* contributors may be used to endorse or promote products derived from *
|
|
* this software without specific prior written permission. *
|
|
* *
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS *
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED *
|
|
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A *
|
|
* PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER *
|
|
* OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, *
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, *
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR *
|
|
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF *
|
|
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING *
|
|
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS *
|
|
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *
|
|
* *
|
|
* ========================================================================= */
|
|
|
|
/*===========================================================================*\
|
|
* *
|
|
* $Revision: 362 $ *
|
|
* $Date: 2011-01-26 10:21:12 +0100 (Mi, 26 Jan 2011) $ *
|
|
* *
|
|
\*===========================================================================*/
|
|
|
|
#define OPENMESH_ARRAY_KERNEL_C
|
|
|
|
//== INCLUDES =================================================================
|
|
|
|
#include <OpenMesh/Core/Mesh/ArrayKernel.hh>
|
|
|
|
//== NAMESPACES ===============================================================
|
|
|
|
namespace OpenMesh
|
|
{
|
|
|
|
//== IMPLEMENTATION ==========================================================
|
|
|
|
template<typename std_API_Container_VHandlePointer,
|
|
typename std_API_Container_HHandlePointer,
|
|
typename std_API_Container_FHandlePointer>
|
|
void ArrayKernel::garbage_collection(std_API_Container_VHandlePointer& vh_to_update,
|
|
std_API_Container_HHandlePointer& hh_to_update,
|
|
std_API_Container_FHandlePointer& fh_to_update,
|
|
bool _v, bool _e, bool _f)
|
|
{
|
|
|
|
#ifdef DEBUG
|
|
#ifndef OM_GARBAGE_NO_STATUS_WARNING
|
|
if ( !this->has_vertex_status() )
|
|
omerr() << "garbage_collection: No vertex status available. You can request it: mesh.request_vertex_status() or define OM_GARBAGE_NO_STATUS_WARNING to silence this warning." << std::endl;
|
|
if ( !this->has_edge_status() )
|
|
omerr() << "garbage_collection: No edge status available. You can request it: mesh.request_edge_status() or define OM_GARBAGE_NO_STATUS_WARNING to silence this warning." << std::endl;
|
|
if ( !this->has_face_status() )
|
|
omerr() << "garbage_collection: No face status available. You can request it: mesh.request_face_status() or define OM_GARBAGE_NO_STATUS_WARNING to silence this warning." << std::endl;
|
|
#endif
|
|
#endif
|
|
|
|
const bool track_vhandles = ( !vh_to_update.empty() );
|
|
const bool track_hhandles = ( !hh_to_update.empty() );
|
|
const bool track_fhandles = ( !fh_to_update.empty() );
|
|
|
|
int i, i0, i1;
|
|
|
|
int nV = int(n_vertices());
|
|
int nE = int(n_edges());
|
|
int nH = int(2*n_edges());
|
|
int nF = (int(n_faces()));
|
|
|
|
std::vector<VertexHandle> vh_map;
|
|
std::vector<HalfedgeHandle> hh_map;
|
|
std::vector<FaceHandle> fh_map;
|
|
|
|
std::map <int, int> vertex_inverse_map;
|
|
std::map <int, int> halfedge_inverse_map;
|
|
std::map <int, int> face_inverse_map;
|
|
|
|
// setup handle mapping:
|
|
vh_map.reserve(nV);
|
|
for (i=0; i<nV; ++i) vh_map.push_back(VertexHandle(i));
|
|
|
|
hh_map.reserve(nH);
|
|
for (i=0; i<nH; ++i) hh_map.push_back(HalfedgeHandle(i));
|
|
|
|
fh_map.reserve(nF);
|
|
for (i=0; i<nF; ++i) fh_map.push_back(FaceHandle(i));
|
|
|
|
// remove deleted vertices
|
|
if (_v && n_vertices() > 0 && this->has_vertex_status() )
|
|
{
|
|
i0=0; i1=nV-1;
|
|
|
|
while (1)
|
|
{
|
|
// find 1st deleted and last un-deleted
|
|
while (!status(VertexHandle(i0)).deleted() && i0 < i1) ++i0;
|
|
while ( status(VertexHandle(i1)).deleted() && i0 < i1) --i1;
|
|
if (i0 >= i1) break;
|
|
|
|
// If we keep track of the vertex handles for updates,
|
|
// we need to have the opposite direction
|
|
if ( track_vhandles ) {
|
|
vertex_inverse_map[i1] = i0;
|
|
vertex_inverse_map[i0] = -1;
|
|
}
|
|
|
|
// swap
|
|
std::swap(vertices_[i0], vertices_[i1]);
|
|
std::swap(vh_map[i0], vh_map[i1]);
|
|
vprops_swap(i0, i1);
|
|
};
|
|
|
|
vertices_.resize(status(VertexHandle(i0)).deleted() ? i0 : i0+1);
|
|
vprops_resize(n_vertices());
|
|
}
|
|
|
|
|
|
// remove deleted edges
|
|
if (_e && n_edges() > 0 && this->has_edge_status() )
|
|
{
|
|
i0=0; i1=nE-1;
|
|
|
|
while (1)
|
|
{
|
|
// find 1st deleted and last un-deleted
|
|
while (!status(EdgeHandle(i0)).deleted() && i0 < i1) ++i0;
|
|
while ( status(EdgeHandle(i1)).deleted() && i0 < i1) --i1;
|
|
if (i0 >= i1) break;
|
|
|
|
// If we keep track of the vertex handles for updates,
|
|
// we need to have the opposite direction
|
|
if ( track_hhandles ) {
|
|
halfedge_inverse_map[2*i1] = 2 * i0;
|
|
halfedge_inverse_map[2*i0] = -1;
|
|
|
|
halfedge_inverse_map[2*i1 + 1] = 2 * i0 + 1;
|
|
halfedge_inverse_map[2*i0 + 1] = -1;
|
|
}
|
|
|
|
// swap
|
|
std::swap(edges_[i0], edges_[i1]);
|
|
std::swap(hh_map[2*i0], hh_map[2*i1]);
|
|
std::swap(hh_map[2*i0+1], hh_map[2*i1+1]);
|
|
eprops_swap(i0, i1);
|
|
hprops_swap(2*i0, 2*i1);
|
|
hprops_swap(2*i0+1, 2*i1+1);
|
|
};
|
|
|
|
edges_.resize(status(EdgeHandle(i0)).deleted() ? i0 : i0+1);
|
|
eprops_resize(n_edges());
|
|
hprops_resize(n_halfedges());
|
|
}
|
|
|
|
|
|
// remove deleted faces
|
|
if (_f && n_faces() > 0 && this->has_face_status() )
|
|
{
|
|
i0=0; i1=nF-1;
|
|
|
|
while (1)
|
|
{
|
|
// find 1st deleted and last un-deleted
|
|
while (!status(FaceHandle(i0)).deleted() && i0 < i1) ++i0;
|
|
while ( status(FaceHandle(i1)).deleted() && i0 < i1) --i1;
|
|
if (i0 >= i1) break;
|
|
|
|
// If we keep track of the face handles for updates,
|
|
// we need to have the opposite direction
|
|
if ( track_fhandles ) {
|
|
face_inverse_map[i1] = i0;
|
|
face_inverse_map[i0] = -1;
|
|
}
|
|
|
|
// swap
|
|
std::swap(faces_[i0], faces_[i1]);
|
|
std::swap(fh_map[i0], fh_map[i1]);
|
|
fprops_swap(i0, i1);
|
|
};
|
|
|
|
faces_.resize(status(FaceHandle(i0)).deleted() ? i0 : i0+1);
|
|
fprops_resize(n_faces());
|
|
}
|
|
|
|
|
|
// update handles of vertices
|
|
if (_e)
|
|
{
|
|
KernelVertexIter v_it(vertices_begin()), v_end(vertices_end());
|
|
VertexHandle vh;
|
|
|
|
for (; v_it!=v_end; ++v_it)
|
|
{
|
|
vh = handle(*v_it);
|
|
if (!is_isolated(vh))
|
|
{
|
|
set_halfedge_handle(vh, hh_map[halfedge_handle(vh).idx()]);
|
|
}
|
|
}
|
|
}
|
|
|
|
HalfedgeHandle hh;
|
|
// update handles of halfedges
|
|
for (KernelEdgeIter e_it(edges_begin()); e_it != edges_end(); ++e_it)
|
|
{//in the first pass update the (half)edges vertices
|
|
hh = halfedge_handle(handle(*e_it), 0);
|
|
set_vertex_handle(hh, vh_map[to_vertex_handle(hh).idx()]);
|
|
hh = halfedge_handle(handle(*e_it), 1);
|
|
set_vertex_handle(hh, vh_map[to_vertex_handle(hh).idx()]);
|
|
}
|
|
for (KernelEdgeIter e_it(edges_begin()); e_it != edges_end(); ++e_it)
|
|
{//in the second pass update the connectivity of the (half)edges
|
|
hh = halfedge_handle(handle(*e_it), 0);
|
|
set_next_halfedge_handle(hh, hh_map[next_halfedge_handle(hh).idx()]);
|
|
if (!is_boundary(hh))
|
|
{
|
|
set_face_handle(hh, fh_map[face_handle(hh).idx()]);
|
|
}
|
|
hh = halfedge_handle(handle(*e_it), 1);
|
|
set_next_halfedge_handle(hh, hh_map[next_halfedge_handle(hh).idx()]);
|
|
if (!is_boundary(hh))
|
|
{
|
|
set_face_handle(hh, fh_map[face_handle(hh).idx()]);
|
|
}
|
|
}
|
|
|
|
// update handles of faces
|
|
if (_e)
|
|
{
|
|
KernelFaceIter f_it(faces_begin()), f_end(faces_end());
|
|
FaceHandle fh;
|
|
|
|
for (; f_it!=f_end; ++f_it)
|
|
{
|
|
fh = handle(*f_it);
|
|
set_halfedge_handle(fh, hh_map[halfedge_handle(fh).idx()]);
|
|
}
|
|
}
|
|
|
|
const int vertexCount = int(vertices_.size());
|
|
const int halfedgeCount = int(edges_.size() * 2);
|
|
const int faceCount = int(faces_.size());
|
|
|
|
// Update the vertex handles in the vertex handle vector
|
|
typename std_API_Container_VHandlePointer::iterator v_it(vh_to_update.begin()), v_it_end(vh_to_update.end());
|
|
for(; v_it != v_it_end; ++v_it)
|
|
{
|
|
|
|
// Only changed vertices need to be considered
|
|
if ( (*v_it)->idx() != vh_map[(*v_it)->idx()].idx() ) {
|
|
*(*v_it) = VertexHandle(vertex_inverse_map[(*v_it)->idx()]);
|
|
|
|
// Vertices above the vertex count have to be already mapped, or they are invalid now!
|
|
} else if ( ((*v_it)->idx() >= vertexCount) && (vertex_inverse_map.find((*v_it)->idx()) == vertex_inverse_map.end()) ) {
|
|
(*v_it)->invalidate();
|
|
}
|
|
|
|
}
|
|
|
|
// Update the halfedge handles in the halfedge handle vector
|
|
typename std_API_Container_HHandlePointer::iterator hh_it(hh_to_update.begin()), hh_it_end(hh_to_update.end());
|
|
for(; hh_it != hh_it_end; ++hh_it)
|
|
{
|
|
// Only changed faces need to be considered
|
|
if ( (*hh_it)->idx() != hh_map[(*hh_it)->idx()].idx() ) {
|
|
*(*hh_it) = HalfedgeHandle(halfedge_inverse_map[(*hh_it)->idx()]);
|
|
|
|
// Vertices above the face count have to be already mapped, or they are invalid now!
|
|
} else if ( ((*hh_it)->idx() >= halfedgeCount) && (halfedge_inverse_map.find((*hh_it)->idx()) == halfedge_inverse_map.end()) ) {
|
|
(*hh_it)->invalidate();
|
|
}
|
|
|
|
}
|
|
|
|
// Update the face handles in the face handle vector
|
|
typename std_API_Container_FHandlePointer::iterator fh_it(fh_to_update.begin()), fh_it_end(fh_to_update.end());
|
|
for(; fh_it != fh_it_end; ++fh_it)
|
|
{
|
|
|
|
// Only changed faces need to be considered
|
|
if ( (*fh_it)->idx() != fh_map[(*fh_it)->idx()].idx() ) {
|
|
*(*fh_it) = FaceHandle(face_inverse_map[(*fh_it)->idx()]);
|
|
|
|
// Vertices above the face count have to be already mapped, or they are invalid now!
|
|
} else if ( ((*fh_it)->idx() >= faceCount) && (face_inverse_map.find((*fh_it)->idx()) == face_inverse_map.end()) ) {
|
|
(*fh_it)->invalidate();
|
|
}
|
|
|
|
}
|
|
}
|
|
|
|
}
|
|
|