Files
openmesh/src/OpenMesh/Tools/Subdivider/Adaptive/Composite/CompositeTraits.hh

261 lines
8.9 KiB
C++
Raw Normal View History

/* ========================================================================= *
* *
* 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. *
* *
* ========================================================================= */
/** \file Subdivider/Adaptive/Composite/CompositeTraits.hh
Mesh traits for adaptive composite subdivider.
*/
//=============================================================================
//
// CLASS Traits
//
//=============================================================================
#ifndef OPENMESH_SUBDIVIDER_ADAPTIVE_COMPOSITETRAITS_HH
#define OPENMESH_SUBDIVIDER_ADAPTIVE_COMPOSITETRAITS_HH
//== INCLUDES =================================================================
#include <map>
#include <OpenMesh/Core/Mesh/Traits.hh>
//== NAMESPACE ================================================================
namespace OpenMesh { // BEGIN_NS_OPENMESH
namespace Subdivider { // BEGIN_NS_DECIMATER
namespace Adaptive { // BEGIN_NS_ADAPTIVE
//== CLASS DEFINITION =========================================================
/** Adaptive Composite Subdivision framework.
*/
// typedef unsigned short state_t;
// const state_t mask_final = 1 << ((sizeof(state_t)*8)-1);
// const state_t mask_state = ~mask_final;
/** Mesh traits for adaptive composite subdivision
*/
struct CompositeTraits : public OpenMesh::DefaultTraits
{
typedef int state_t; ///< External representation for intermediate state
typedef bool final_t; ///< External representation for final flag
/// Storage type for intermediate states and the final flag of a mesh entity.
struct State
{
int state : 31;
unsigned final : 1;
};
// ---------------------------------------- attributes
// add face normals
FaceAttributes( OpenMesh::Attributes::Normal );
// add vertex normals
VertexAttributes( OpenMesh::Attributes::Normal );
// add previous halfedge handle
HalfedgeAttributes( OpenMesh::Attributes::PrevHalfedge );
// ---------------------------------------- items
FaceTraits
{
private:
typedef typename Refs::Point Point;
typedef typename Refs::HalfedgeHandle HalfedgeHandle;
typedef std::map<state_t, Point> PositionHistory;
State state_;
HalfedgeHandle red_halfedge_;
PositionHistory pos_map_;
public:
// face state
state_t state() const { return state_t(state_.state); }
void set_state(const state_t _s) { state_.state = _s; }
void inc_state() { ++state_.state; }
// face not final if divided (loop) or edge not flipped (sqrt(3))
final_t final() const { return final_t(state_.final); }
void set_final() { state_.final = true; }
void set_not_final() { state_.final = false; }
// halfedge of dividing edge (red-green triangulation)
const HalfedgeHandle& red_halfedge() const { return red_halfedge_; }
void set_red_halfedge(const HalfedgeHandle& _h) { red_halfedge_ = _h; }
// position of face, depending on generation _i.
void set_position(const int& _i, const Point& _p) { pos_map_[_i] = _p; }
const Point position(const int& _i) {
if (pos_map_.find(_i) != pos_map_.end())
return pos_map_[_i];
else {
if (_i <= 0) {
return Point(0.0, 0.0, 0.0);
}
return position(_i - 1);
}
}
}; // end class FaceTraits
EdgeTraits
{
private:
typedef typename Refs::Point Point;
typedef std::map<state_t, Point> PositionHistory;
State state_;
PositionHistory pos_map_;
public:
typedef typename Refs::Scalar Scalar;
// Scalar weight_;
// state of edge
state_t state() const { return state_t(state_.state); }
void set_state(const state_t _s) { state_.state = _s; }
void inc_state() { ++state_.state; }
// edge not final if dividing face (Loop) or edge not flipped (SQRT(3))
final_t final() const { return final_t(state_.final); }
void set_final() { state_.final = true; }
void set_not_final() { state_.final = false; }
// position of edge, depending on generation _i.
void set_position(const int& _i, const Point& _p) { pos_map_[_i] = _p; }
const Point position(const int& _i) {
if (pos_map_.find(_i) != pos_map_.end())
return pos_map_[_i];
else
{
if (_i <= 0)
{
const Point zero_point(0.0, 0.0, 0.0);
return zero_point;
}
return position(_i - 1);
}
}
}; // end class EdgeTraits
VertexTraits
{
private:
typedef typename Refs::Point Point;
typedef std::map<state_t, Point> PositionHistory;
State state_;
PositionHistory pos_map_;
public:
// state of vertex
state_t state() const { return state_.state; }
void set_state(const state_t _s) { state_.state = _s; }
void inc_state() { ++state_.state; }
// usually not needed by loop or sqrt(3)
final_t final() const { return state_.final; }
void set_final() { state_.final = true; }
void set_not_final() { state_.final = false; }
// position of vertex, depending on generation _i. (not for display)
void set_position(const int& _i, const Point& _p) { pos_map_[_i] = _p; }
const Point position(const int& _i) {
if (pos_map_.find(_i) != pos_map_.end())
return pos_map_[_i];
else {
if (_i <= 0) {
const Point zero_point(0.0, 0.0, 0.0);
return zero_point;
}
return position(_i - 1);
}
}
}; // end class VertexTraits
}; // end class CompositeTraits
// export items to namespace to maintain compatibility
typedef CompositeTraits::state_t state_t;
typedef CompositeTraits::final_t final_t;
typedef CompositeTraits::State State;
//=============================================================================
} // END_NS_ADAPTIVE
} // END_NS_SUBDIVIDER
} // END_NS_OPENMESH
//=============================================================================
#endif // OPENMESH_SUBDIVIDER_ADAPTIVE_COMPOSITETRAITS_HH defined
//=============================================================================