MRVertDuplication.h

Go to the documentation of this file.

#pragma once
 
#include "MRId.h"
#include "MRPch/MRBindingMacros.h"
#include <cassert>
#include <functional>
#include <cstdint>
#include <utility>
#include <vector>
 
namespace MR
{
 
 
namespace MeshBuilder
{
 
struct VertDuplication
{
    VertId srcVert; 
    VertId dupVert; 
};

using BetterDupContinuation = std::function<bool( VertId e0, VertId e1, VertId vRef, VertId vCand, VertId vBest )>;

MRMESH_API size_t duplicateNonManifoldVertices( Triangulation & t, FaceBitSet * region = nullptr,
    std::vector<VertDuplication>* dups = nullptr, VertId lastValidVert = {}, const BetterDupContinuation & betterCont = {} );

struct VertInfo
{
    [[nodiscard]] bool hasRepeatedVerts() const { return ( data_ & 1 ) != 0; }

    [[nodiscard]] std::uint32_t numRepeatedVerts() const { return hasRepeatedVerts() ? ( data_ >> 1 ) & maxNumRepeatedVerts : 0; }

    [[nodiscard]] std::uint32_t maxVertRepetitions() const { return hasRepeatedVerts() ? data_ >> 17 : 0; }

    [[nodiscard]] std::uint32_t numOpenChains() const { return hasRepeatedVerts() ? 0 : ( data_ >> 1 ) & maxNumOpenChains; }

    [[nodiscard]] std::uint32_t numClosedChains() const { return hasRepeatedVerts() ? 0 : data_ >> 17; }

    [[nodiscard]] std::uint32_t numChains() const { return numOpenChains() + numClosedChains(); }

    [[nodiscard]] bool duplicationNeeded() const
    {
        return hasRepeatedVerts() ||
            !( numOpenChains() + numClosedChains() <= 1
            || ( numOpenChains() == 2 && numClosedChains() == 0 ) );
    }

    [[nodiscard]] bool areTwinChains( std::uint32_t numTris ) const
    {
        return maxVertRepetitions() == 1 && numTris == numRepeatedVerts();
    }
 
    void setNumChains( std::uint32_t openChains, std::uint32_t closedChains )
    {
        data_ = ( std::min( openChains, maxNumOpenChains ) << 1 ) +
                ( std::min( closedChains, maxNumClosedChains ) << 17 );
    }
 
    void setNumRepeatedVerts( std::uint32_t repeatedVerts, std::uint32_t maxVertRepetitions )
    {
        assert( repeatedVerts >= 1 );
        assert( maxVertRepetitions >= 1 );
        assert( repeatedVerts >= maxVertRepetitions );
        repeatedVerts = std::min( repeatedVerts, maxNumRepeatedVerts );
        maxVertRepetitions = std::min( maxVertRepetitions, maxMaxVertRepetitions );
        data_ = 1 + ( repeatedVerts << 1 ) + ( maxVertRepetitions << 17 );
    }

    static constexpr std::uint32_t maxNumOpenChains = ( 1u << 16 ) - 1;
    static constexpr std::uint32_t maxNumClosedChains = ( 1u << 15 ) - 1;
    static constexpr std::uint32_t maxNumRepeatedVerts = ( 1u << 16 ) - 1;
    static constexpr std::uint32_t maxMaxVertRepetitions = ( 1u << 15 ) - 1;
 
private:
    std::uint32_t data_ = 0;
};
static_assert( sizeof( VertInfo ) == 4 );

struct VertTri
{
    VertId v;
    FaceId f;
 
    auto asPair() const { return std::make_pair( v, f ); }
    friend bool operator <( const VertTri& l, const VertTri& r ) { return l.asPair() < r.asPair(); }
};

[[nodiscard]] MRMESH_API MR_BIND_IGNORE_PY VertInfo inspectVertNeighbourhood( const Triangulation & t, const VertTri * begin, const VertTri * end );
 
}
 
}