brep-mesh.cpp

Go to the documentation of this file.

/*
 * Copyright (C) 2023  Christopher J. Howard
 *
 * This file is part of Antkeeper source code.
 *
 * Antkeeper source code is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Antkeeper source code 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Antkeeper source code.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#include <engine/geom/brep/brep-mesh.hpp>
#include <engine/math/vector.hpp>
#include <engine/resources/resource-loader.hpp>
#include <engine/resources/deserialize-error.hpp>
#include <engine/resources/deserializer.hpp>
#include <array>
 
namespace geom {
 
brep_mesh::brep_mesh() noexcept:
    m_vertices(this),
    m_edges(this),
    m_loops(this),
    m_faces(this)
{}
 
brep_mesh::brep_mesh(const brep_mesh& other):
    brep_mesh()
{
    *this = other;
}
 
brep_mesh& brep_mesh::operator=(const brep_mesh& other)
{
    // Allocate containers
    m_vertices.m_elements.resize(other.m_vertices.m_elements.size());
    m_edges.m_elements.resize(other.m_edges.m_elements.size());
    m_loops.m_elements.resize(other.m_loops.m_elements.size());
    m_faces.m_elements.resize(other.m_faces.m_elements.size());
    
    // Copy-construct elements
    for (std::size_t i = 0; i < m_vertices.m_elements.size(); ++i)
    {
        m_vertices.m_elements[i] = std::make_unique<brep_vertex>(*other.m_vertices.m_elements[i]);
    }
    for (std::size_t i = 0; i < m_edges.m_elements.size(); ++i)
    {
        m_edges.m_elements[i] = std::make_unique<brep_edge>(*other.m_edges.m_elements[i]);
    }
    for (std::size_t i = 0; i < m_loops.m_elements.size(); ++i)
    {
        m_loops.m_elements[i] = std::make_unique<brep_loop>(*other.m_loops.m_elements[i]);
    }
    for (std::size_t i = 0; i < m_faces.m_elements.size(); ++i)
    {
        m_faces.m_elements[i] = std::make_unique<brep_face>(*other.m_faces.m_elements[i]);
    }
    
    // Copy per-element attributes
    m_vertices.m_attribute_map = other.m_vertices.m_attribute_map;
    m_edges.m_attribute_map = other.m_edges.m_attribute_map;
    m_loops.m_attribute_map = other.m_loops.m_attribute_map;
    m_faces.m_attribute_map = other.m_faces.m_attribute_map;
    
    // Reassign element pointers
    for (const auto& vertex: m_vertices.m_elements)
    {
        if (!vertex->edges().empty())
        {
            vertex->m_edges.m_head = m_edges.m_elements[vertex->m_edges.m_head->m_index].get();
        }
    }
    for (const auto& edge: m_edges.m_elements)
    {
        edge->m_vertices[0] = m_vertices.m_elements[edge->m_vertices[0]->m_index].get();
        edge->m_vertices[1] = m_vertices.m_elements[edge->m_vertices[1]->m_index].get();
        edge->m_vertex_next[0] = m_edges.m_elements[edge->m_vertex_next[0]->m_index].get();
        edge->m_vertex_next[1] = m_edges.m_elements[edge->m_vertex_next[1]->m_index].get();
        edge->m_vertex_previous[0] = m_edges.m_elements[edge->m_vertex_previous[0]->m_index].get();
        edge->m_vertex_previous[1] = m_edges.m_elements[edge->m_vertex_previous[1]->m_index].get();
        
        if (!edge->loops().empty())
        {
            edge->m_loops.m_head = m_loops.m_elements[edge->m_loops.m_head->m_index].get();
        }
    }
    for (const auto& loop: m_loops.m_elements)
    {
        loop->m_vertex = m_vertices.m_elements[loop->m_vertex->m_index].get();
        loop->m_edge = m_edges.m_elements[loop->m_edge->m_index].get();
        loop->m_face = m_faces.m_elements[loop->m_face->m_index].get();
        loop->m_edge_next = m_loops.m_elements[loop->m_edge_next->m_index].get();
        loop->m_edge_previous = m_loops.m_elements[loop->m_edge_previous->m_index].get();
        loop->m_face_next = m_loops.m_elements[loop->m_face_next->m_index].get();
        loop->m_face_previous = m_loops.m_elements[loop->m_face_previous->m_index].get();
    }
    for (const auto& face: m_faces.m_elements)
    {
        face->m_loops.m_head = m_loops.m_elements[face->m_loops.m_head->m_index].get();
    }
    
    return *this;
}
 
void brep_mesh::clear() noexcept
{
    m_vertices.clear();
}
 
} // namespace geom
 
template <>
void deserializer<geom::brep_mesh>::deserialize(geom::brep_mesh& mesh, deserialize_context& ctx)
{
    // Read vertex, edge, and face counts
    std::uint32_t vertex_count = 0;
    std::uint32_t edge_count = 0;
    std::uint32_t face_count = 0;
    ctx.read32<std::endian::little>(reinterpret_cast<std::byte*>(&vertex_count), 1);
    ctx.read32<std::endian::little>(reinterpret_cast<std::byte*>(&edge_count), 1);
    ctx.read32<std::endian::little>(reinterpret_cast<std::byte*>(&face_count), 1);
    
    // Make vertices
    for (std::size_t i = 0; i < vertex_count; ++i)
    {
        mesh.vertices().emplace_back();
    }
    
    // Read edge vertex indices into buffer
    std::vector<std::array<std::uint32_t, 2>> edges(edge_count);
    ctx.read32<std::endian::little>(reinterpret_cast<std::byte*>(edges.data()), edge_count * 2);
    
    // Make edges
    for (const auto& e: edges)
    {
        mesh.edges().emplace_back(mesh.vertices()[e[0]], mesh.vertices()[e[1]]);
    }
    edges.clear();
    
    // Read face vertex indices into buffer
    std::vector<std::array<std::uint32_t, 3>> faces(face_count);
    ctx.read32<std::endian::little>(reinterpret_cast<std::byte*>(faces.data()), face_count * 3);
    
    // Make faces
    for (const auto& f: faces)
    {
        geom::brep_vertex* vertices[3] = {mesh.vertices()[f[0]], mesh.vertices()[f[1]], mesh.vertices()[f[2]]};
        mesh.faces().emplace_back(vertices);
    }
    faces.clear();
    
    // Make vertex attributes
    auto& vertex_positions = static_cast<geom::brep_attribute<math::fvec3>&>(*mesh.vertices().attributes().emplace<math::fvec3>("position"));
    
    // Read vertex attributes
    ctx.read32<std::endian::little>(reinterpret_cast<std::byte*>(vertex_positions.data()), vertex_count * 3);
}
 
template <>
std::unique_ptr<geom::brep_mesh> resource_loader<geom::brep_mesh>::load(::resource_manager& resource_manager, deserialize_context& ctx)
{
    auto resource = std::make_unique<geom::brep_mesh>();
    deserializer<geom::brep_mesh>().deserialize(*resource, ctx);
    return resource;
}