mesh.hpp

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/>.
 */
 
#ifndef ANTKEEPER_GEOM_MESH_HPP
#define ANTKEEPER_GEOM_MESH_HPP
 
#include <engine/utility/fundamental-types.hpp>
#include <vector>
 
namespace geom {
 
class mesh
{
public:
    struct vertex;
    struct edge;
    struct face;
    
    struct vertex
    {
        std::size_t index;
        
        mesh::edge* edge;
        
        float3 position;
    };
    
    struct edge
    {
        std::size_t index;
        
        mesh::vertex* vertex;     
        
        mesh::face* face;
        
        mesh::edge* previous;
        
        mesh::edge* next;
        
        mesh::edge* symmetric;
    };
    
    struct face
    {
        std::size_t index;
        
        mesh::edge* edge;
    };
    
    typedef std::vector<edge*> loop;
    
    constexpr mesh() noexcept = default;
    
    mesh(const mesh& other);
    
    ~mesh() noexcept;
    
    mesh& operator=(const mesh& other);
    
    void clear() noexcept;
    
    mesh::vertex* add_vertex(const float3& position);
    
    mesh::edge* add_edge(mesh::vertex* a, mesh::vertex* b);
    
    mesh::face* add_face(const loop& loop);
    
    void remove_face(mesh::face* face);
    
    void remove_edge(mesh::edge* edge);
    
    void remove_vertex(mesh::vertex* vertex);
    
    const std::vector<mesh::vertex*>& get_vertices() const;
    
    const std::vector<mesh::edge*>& get_edges() const;
    
    const std::vector<mesh::face*>& get_faces() const;
    
private:
    mesh::edge* find_free_incident(mesh::vertex* vertex) const;
    mesh::edge* find_free_incident(mesh::edge* start_edge, mesh::edge* end_edge) const;
    bool make_adjacent(mesh::edge* in_edge, mesh::edge* out_edge);
    
    std::vector<mesh::vertex*> vertices;
    std::vector<mesh::edge*> edges;
    std::vector<mesh::face*> faces;
};
 
inline const std::vector<mesh::vertex*>& mesh::get_vertices() const
{
    return vertices;
}
 
inline const std::vector<mesh::edge*>& mesh::get_edges() const
{
    return edges;
}
 
inline const std::vector<mesh::face*>& mesh::get_faces() const
{
    return faces;
}
 
} // namespace geom
 
#endif // ANTKEEPER_GEOM_MESH_HPP