periodic.h

Go to the documentation of this file.

/*
 *  Copyright (c) 2000-2022 Inria
 *  All rights reserved.
 *
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions are met:
 *
 *  * Redistributions of source code must retain the above copyright notice,
 *  this list of conditions and the following disclaimer.
 *  * 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.
 *  * Neither the name of the ALICE Project-Team 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.
 *
 *  Contact: Bruno Levy
 *
 *     https://www.inria.fr/fr/bruno-levy
 *
 *     Inria,
 *     Domaine de Voluceau,
 *     78150 Le Chesnay - Rocquencourt
 *     FRANCE
 *
 */
 
#ifndef GEOGRAM_DELAUNAY_PERIODIC
#define GEOGRAM_DELAUNAY_PERIODIC
 
#include <geogram/basic/common.h>
#include <geogram/basic/string.h>
#include <geogram/basic/assert.h>
 
namespace GEO {
 
    class GEOGRAM_API Periodic {
    public:
 
    index_t nb_vertices_non_periodic() const {
        return nb_vertices_non_periodic_;
    }
 
    index_t periodic_vertex_instance(index_t pv) const {
        geo_debug_assert(pv < nb_vertices_non_periodic_ * 27);
        return pv / nb_vertices_non_periodic_;
    }
 
    index_t periodic_vertex_real(index_t pv) const {
        geo_debug_assert(pv < nb_vertices_non_periodic_ * 27);
        return pv % nb_vertices_non_periodic_;
    }
 
    index_t make_periodic_vertex(index_t real, index_t instance) const {
        geo_debug_assert(real < nb_vertices_non_periodic_);
        geo_debug_assert(instance < 27);
        return real + nb_vertices_non_periodic_*instance;
    }
 
    static index_t T_to_instance(int Tx, int Ty, int Tz) {
        geo_debug_assert(Tx >= -1 && Tx <= 1);
        geo_debug_assert(Ty >= -1 && Ty <= 1);
        geo_debug_assert(Tz >= -1 && Tz <= 1);
        int i = (Tz+1) + 3*(Ty+1) + 9*(Tx+1);
        geo_debug_assert(i >= 0 && i < 27);
        return index_t(reorder_instances[i]);
    }
 
    void periodic_vertex_get_T(index_t pv, int& Tx, int& Ty, int& Tz) const {
        geo_debug_assert(pv < nb_vertices_non_periodic_ * 27);
        index_t instance = periodic_vertex_instance(pv);
        Tx = translation[instance][0];
        Ty = translation[instance][1];
        Tz = translation[instance][2];
    }
 
    void periodic_vertex_set_T(index_t& pv, int Tx, int Ty, int Tz) const {
        geo_debug_assert(pv < nb_vertices_non_periodic_ * 27);
        geo_debug_assert(Tx >= -1 && Tx <= 1);
        geo_debug_assert(Ty >= -1 && Ty <= 1);
        geo_debug_assert(Tz >= -1 && Tz <= 1);
        pv = make_periodic_vertex(
            periodic_vertex_real(pv), T_to_instance(Tx, Ty, Tz)
        );
    }
 
    std::string periodic_vertex_to_string(index_t v) const {
        return
            String::to_string(periodic_vertex_real(v)) + ":" +
            String::to_string(periodic_vertex_instance(v)) ;
    }
 
    std::string binary_to_string(Numeric::uint32 m) const {
        std::string s(32,' ');
        for(index_t i=0; i<32; ++i) {
            s[i] = ((m & (1u << (31u-i))) != 0) ? '1' : '0';
        }
        return s;
    }
 
    static int translation[27][3];
 
    static int reorder_instances[27];
 
    static bool instance_is_positive[27];
 
    index_t nb_vertices_non_periodic_;
    };
 
}
 
#endif