/* This file is part of Magnum. Copyright © 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025 Vladimír Vondruš Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ #include "Icosphere.h" #include "Magnum/Mesh.h" #include "Magnum/Math/Vector3.h" #include "Magnum/MeshTools/RemoveDuplicates.h" #include "Magnum/MeshTools/Subdivide.h" #include "Magnum/Trade/ArrayAllocator.h" #include "Magnum/Trade/MeshData.h" namespace Magnum { namespace Primitives { namespace { constexpr UnsignedInt Indices[]{ 1, 2, 6, 1, 7, 2, 3, 4, 5, 4, 3, 8, 6, 5, 11, 5, 6, 10, 9, 10, 2, 10, 9, 3, 7, 8, 9, 8, 7, 0, 11, 0, 1, 0, 11, 4, 6, 2, 10, 1, 6, 11, 3, 5, 10, 5, 4, 11, 2, 7, 9, 7, 1, 0, 3, 9, 8, 4, 8, 0 }; /* Can't be just an array of Vector3 because MSVC 2015 is special. See Crosshair.cpp for details. */ constexpr struct VertexSolidStrip { Vector3 position; } Vertices[]{ {{0.0f, -0.525731f, 0.850651f}}, {{0.850651f, 0.0f, 0.525731f}}, {{0.850651f, 0.0f, -0.525731f}}, {{-0.850651f, 0.0f, -0.525731f}}, {{-0.850651f, 0.0f, 0.525731f}}, {{-0.525731f, 0.850651f, 0.0f}}, {{0.525731f, 0.850651f, 0.0f}}, {{0.525731f, -0.850651f, 0.0f}}, {{-0.525731f, -0.850651f, 0.0f}}, {{0.0f, -0.525731f, -0.850651f}}, {{0.0f, 0.525731f, -0.850651f}}, {{0.0f, 0.525731f, 0.850651f}} }; } Trade::MeshData icosphereSolid(const UnsignedInt subdivisions) { /* The size_t cast is needed in order to make MSVC stop complaining that "warning C4334: '<<': result of 32-bit shift implicitly converted to 64 bits (was 64-bit shift intended?)". There's an implicit conversion happening *after* the shift, yes, but how on earth does that imply that a 64-bit shift was intended?! */ const std::size_t indexCount = Containers::arraySize(Indices)*(std::size_t{1} << subdivisions*2); const std::size_t vertexCount = Containers::arraySize(Vertices) + ((indexCount - Containers::arraySize(Indices))/3); Containers::Array indexData{indexCount*sizeof(UnsignedInt)}; auto indices = Containers::arrayCast(indexData); std::memcpy(indices.begin(), Indices, sizeof(Indices)); struct Vertex { Vector3 position; Vector3 normal; }; Containers::Array vertexData; Containers::arrayResize(vertexData, NoInit, sizeof(Vertex)*vertexCount); /* Build up the subdivided positions */ { auto vertices = Containers::arrayCast(vertexData); Containers::StridedArrayView1D positions{vertices, &vertices[0].position, vertices.size(), sizeof(Vertex)}; for(std::size_t i = 0; i != Containers::arraySize(Vertices); ++i) positions[i] = Vertices[i].position; for(std::size_t i = 0; i != subdivisions; ++i) { /* The size_t cast is needed in order to make MSVC stop complaining that "warning C4334: '<<': result of 32-bit shift implicitly converted to 64 bits (was 64-bit shift intended?)". There's an implicit conversion happening *after* the shift, yes, but how on earth does that imply that a 64-bit shift was intended?! */ const std::size_t iterationIndexCount = Containers::arraySize(Indices)*(std::size_t{1} << (i + 1)*2); const std::size_t iterationVertexCount = Containers::arraySize(Vertices) + ((iterationIndexCount - Containers::arraySize(Indices))/3); MeshTools::subdivideInPlace(indices.prefix(iterationIndexCount), positions.prefix(iterationVertexCount), [](const Vector3& a, const Vector3& b) { return (a+b).normalized(); }); } /** @todo i need arrayShrinkAndGiveUpMemoryIfItDoesntCauseRealloc() */ Containers::arrayResize(vertexData, MeshTools::removeDuplicatesIndexedInPlace( Containers::stridedArrayView(indices), Containers::arrayCast<2, char>(positions))*sizeof(Vertex)); } /* Build up the views again with correct size, fill the normals */ auto vertices = Containers::arrayCast(vertexData); Containers::StridedArrayView1D positions{vertices, &vertices[0].position, vertices.size(), sizeof(Vertex)}; Containers::StridedArrayView1D normals{vertices, &vertices[0].normal, vertices.size(), sizeof(Vertex)}; for(std::size_t i = 0; i != positions.size(); ++i) normals[i] = positions[i]; return Trade::MeshData{MeshPrimitive::Triangles, Utility::move(indexData), Trade::MeshIndexData{indices}, Utility::move(vertexData), {Trade::MeshAttributeData{Trade::MeshAttribute::Position, positions}, Trade::MeshAttributeData{Trade::MeshAttribute::Normal, normals}}}; } namespace { /* Taking the above, converting each triangle to three lines and leaving out the duplicates. Because each edge is shared by two triangles and there was 20 triangles to begin with, there's 30 edges. */ constexpr UnsignedInt IndicesWireframe[]{ 1, 2, 2, 6, 6, 1, 1, 7, 7, 2, 3, 4, 4, 5, 5, 3, 3, 8, 8, 4, 6, 5, 5, 11, 11, 6, 6, 10, 10, 5, 9, 10, 10, 2, 2, 9, 9, 3, 3, 10, 7, 8, 8, 9, 9, 7, 7, 0, 0, 8, 11, 0, 0, 1, 1, 11, 11, 4, 4, 0 }; constexpr Trade::MeshAttributeData AttributesWireframe[]{ Trade::MeshAttributeData{Trade::MeshAttribute::Position, Containers::stridedArrayView(Vertices, &Vertices[0].position, Containers::arraySize(Vertices), sizeof(Vector3))} }; } Trade::MeshData icosphereWireframe() { return Trade::MeshData{MeshPrimitive::Lines, {}, IndicesWireframe, Trade::MeshIndexData{IndicesWireframe}, {}, Vertices, Trade::meshAttributeDataNonOwningArray(AttributesWireframe)}; } }}