DOLFINx 0.11.0.0
DOLFINx C++
Loading...
Searching...
No Matches
Geometry.h
1// Copyright (C) 2006-2022 Anders Logg and Garth N. Wells
2//
3// This file is part of DOLFINx (https://www.fenicsproject.org)
4//
5// SPDX-License-Identifier: LGPL-3.0-or-later
6
7#pragma once
8
9#include "Topology.h"
10#include <algorithm>
11#include <basix/mdspan.hpp>
12#include <concepts>
13#include <cstdint>
14#include <dolfinx/common/IndexMap.h>
15#include <dolfinx/common/MPI.h>
16#include <dolfinx/common/sort.h>
17#include <dolfinx/fem/CoordinateElement.h>
18#include <dolfinx/fem/ElementDofLayout.h>
19#include <dolfinx/fem/dofmapbuilder.h>
20#include <dolfinx/graph/AdjacencyList.h>
21#include <dolfinx/graph/partition.h>
22#include <functional>
23#include <memory>
24#include <span>
25#include <utility>
26#include <vector>
27
28namespace dolfinx::mesh
29{
30
32template <std::floating_point T>
34{
35public:
37 using value_type = T;
38
62 template <typename U, typename V, typename W>
63 requires std::is_convertible_v<std::remove_cvref_t<U>,
64 std::vector<std::vector<std::int32_t>>>
65 and std::is_convertible_v<std::remove_cvref_t<V>,
66 std::vector<T>>
67 and std::is_convertible_v<std::remove_cvref_t<W>,
68 std::vector<std::int64_t>>
70 std::shared_ptr<const common::IndexMap> index_map, U&& dofmaps,
71 const std::vector<fem::CoordinateElement<
72 typename std::remove_reference_t<typename V::value_type>>>& elements,
73 V&& x, int dim, W&& input_global_indices)
74 : _dim(dim), _dofmaps(std::forward<U>(dofmaps)),
75 _index_map(std::move(index_map)), _cmaps(elements),
76 _x(std::forward<V>(x)),
77 _input_global_indices(std::forward<W>(input_global_indices))
78 {
79 assert(_x.size() % 3 == 0);
80 if (_x.size() / 3 != _input_global_indices.size())
81 throw std::runtime_error("Geometry size mismatch.");
82
83 if (_dofmaps.size() != _cmaps.size())
84 {
85 throw std::runtime_error("Geometry number of dofmaps not equal to the "
86 "number of coordinate elements.");
87 }
88
89 // TODO: check that elements dim == number of dofmap columns
90 }
91
93 Geometry(const Geometry&) = default;
94
96 Geometry(Geometry&&) = default;
97
99 ~Geometry() = default;
100
102 Geometry& operator=(const Geometry&) = delete;
103
106
108 int dim() const { return _dim; }
109
112 md::mdspan<const std::int32_t, md::dextents<std::size_t, 2>> dofmap() const
113 {
114 if (_dofmaps.size() != 1)
115 throw std::runtime_error("Multiple dofmaps");
116 return this->dofmap(0);
117 }
118
125 md::mdspan<const std::int32_t, md::dextents<std::size_t, 2>>
126 dofmap(std::size_t i) const
127 {
128 std::size_t ndofs = _cmaps.at(i).dim();
129 return md::mdspan<const std::int32_t, md::dextents<std::size_t, 2>>(
130 _dofmaps.at(i).data(), _dofmaps.at(i).size() / ndofs, ndofs);
131 }
132
135 std::shared_ptr<const common::IndexMap> index_map() const
136 {
137 return _index_map;
138 }
139
144 std::span<const value_type> x() const { return _x; }
145
151 std::span<value_type> x() { return _x; }
152
159 const fem::CoordinateElement<value_type>& cmap(std::optional<int> i
160 = std::nullopt) const
161 {
162 if (i.has_value())
163 return _cmaps.at(*i);
164 else if (_cmaps.size() > 1)
165 throw std::runtime_error("Multiple cmaps.");
166 return _cmaps.front();
167 }
168
173 std::size_t num_maps() const { return _cmaps.size(); }
174
176 const std::vector<std::int64_t>& input_global_indices() const
177 {
178 return _input_global_indices;
179 }
180
181private:
182 // Geometric dimension
183 int _dim;
184
185 // Map per cell for extracting coordinate data for each cmap
186 std::vector<std::vector<std::int32_t>> _dofmaps;
187
188 // IndexMap for geometry 'dofmap'
189 std::shared_ptr<const common::IndexMap> _index_map;
190
191 // The coordinate elements
192 std::vector<fem::CoordinateElement<value_type>> _cmaps;
193
194 // Coordinates for all points stored as a contiguous array (row-major,
195 // column size = 3)
196 std::vector<value_type> _x;
197
198 // Global indices as provided on Geometry creation
199 std::vector<std::int64_t> _input_global_indices;
200};
201
204template <typename U, typename V, typename W>
205Geometry(std::shared_ptr<const common::IndexMap>, U&&,
206 const std::vector<fem::CoordinateElement<
207 typename std::remove_reference_t<typename V::value_type>>>&,
208 V&&, int, W&&)
209 -> Geometry<typename std::remove_cvref_t<typename V::value_type>>;
211
236template <typename U>
237Geometry<typename std::remove_reference_t<typename U::value_type>>
238create_geometry(const Topology& topology,
239 const std::vector<fem::CoordinateElement<
240 std::remove_reference_t<typename U::value_type>>>& elements,
241 std::span<const std::int64_t> nodes,
242 std::span<const std::int64_t> xdofs, const U& x, int dim,
243 const std::function<std::vector<int>(
244 const graph::AdjacencyList<std::int32_t>&)>& reorder_fn
245 = nullptr)
246{
247 spdlog::info("Create Geometry (multiple)");
248
249 assert(std::ranges::is_sorted(nodes));
250 using T = typename std::remove_reference_t<typename U::value_type>;
251
252 // Check elements match cell types in topology
253 const int tdim = topology.dim();
254 const std::size_t num_cell_types = topology.entity_types(tdim).size();
255 if (elements.size() != num_cell_types)
256 throw std::runtime_error("Mismatch between topology and geometry.");
257
258 std::vector<fem::ElementDofLayout> dof_layouts;
259 dof_layouts.reserve(elements.size());
260 for (auto& el : elements)
261 dof_layouts.push_back(el.create_dof_layout());
262
263 spdlog::info("Got {} dof layouts", dof_layouts.size());
264
265 // Build 'geometry' dofmap on the topology
266 auto [_dof_index_map, bs, dofmaps]
267 = fem::build_dofmap_data(topology.index_maps(topology.dim())[0]->comm(),
268 topology, dof_layouts, reorder_fn);
269 auto dof_index_map
270 = std::make_shared<common::IndexMap>(std::move(_dof_index_map));
271
272 // If the mesh has higher order geometry, permute the dofmap
273 if (elements.front().needs_dof_permutations())
274 {
275 const std::int32_t num_cells
276 = topology.connectivity(topology.dim(), 0)->num_nodes();
277 const std::vector<std::uint32_t>& cell_info
278 = topology.get_cell_permutation_info();
279 int d = elements.front().dim();
280 for (std::int32_t cell = 0; cell < num_cells; ++cell)
281 {
282 std::span dofs(dofmaps.front().data() + cell * d, d);
283 elements.front().permute_inv(dofs, cell_info[cell]);
284 }
285 }
286
287 spdlog::info("Calling compute_local_to_global");
288 // Compute local-to-global map from local indices in dofmap to the
289 // corresponding global indices in cells, and pass to function to
290 // compute local (dof) to local (position in coords) map from (i)
291 // local-to-global for dofs and (ii) local-to-global for entries in
292 // coords
293
294 spdlog::info("xdofs.size = {}", xdofs.size());
295 std::vector<std::int32_t> all_dofmaps;
296 std::stringstream s;
297 for (auto q : dofmaps)
298 {
299 s << q.size() << " ";
300 all_dofmaps.insert(all_dofmaps.end(), q.begin(), q.end());
301 }
302 spdlog::info("dofmap sizes = {}", s.str());
303 spdlog::info("all_dofmaps.size = {}", all_dofmaps.size());
304 spdlog::info("nodes.size = {}", nodes.size());
305
306 const std::vector<std::int32_t> l2l = graph::build::compute_local_to_local(
307 graph::build::compute_local_to_global(xdofs, all_dofmaps), nodes);
308
309 // Allocate space for input global indices and copy data
310 std::vector<std::int64_t> igi(nodes.size());
311 std::ranges::transform(l2l, igi.begin(),
312 [&nodes](auto index) { return nodes[index]; });
313
314 // Build coordinate dof array, copying coordinates to correct position
315 assert(x.size() % dim == 0);
316 const std::size_t shape0 = x.size() / dim;
317 const std::size_t shape1 = dim;
318 std::vector<T> xg(3 * shape0, 0);
319 for (std::size_t i = 0; i < shape0; ++i)
320 {
321 std::copy_n(std::next(x.begin(), shape1 * l2l[i]), shape1,
322 std::next(xg.begin(), 3 * i));
323 }
324
325 spdlog::info("Creating geometry with {} dofmaps", dof_layouts.size());
326
327 return Geometry(dof_index_map, std::move(dofmaps), elements, std::move(xg),
328 dim, std::move(igi));
329}
330
331} // namespace dolfinx::mesh
Definition CoordinateElement.h:38
This class provides a static adjacency list data structure.
Definition AdjacencyList.h:38
Geometry stores the geometry imposed on a mesh.
Definition Geometry.h:34
~Geometry()=default
Destructor.
std::span< value_type > x()
Access geometry degrees-of-freedom data (non-const version).
Definition Geometry.h:151
md::mdspan< const std::int32_t, md::dextents< std::size_t, 2 > > dofmap(std::size_t i) const
Degree-of-freedom map associated with the ith coordinate map element in the geometry.
Definition Geometry.h:126
std::size_t num_maps() const
Number of coordinate maps and dofmaps (which must be the same) in the geometry, when consisting of di...
Definition Geometry.h:173
const fem::CoordinateElement< value_type > & cmap(std::optional< int > i=std::nullopt) const
The elements that describes the geometry map.
Definition Geometry.h:159
std::shared_ptr< const common::IndexMap > index_map() const
Index map for the geometry 'degrees-of-freedom'.
Definition Geometry.h:135
Geometry(Geometry &&)=default
Move constructor.
Geometry(const Geometry &)=default
Copy constructor.
int dim() const
Return dimension of the Euclidean coordinate system.
Definition Geometry.h:108
Geometry & operator=(Geometry &&)=default
Move assignment.
Geometry(std::shared_ptr< const common::IndexMap > index_map, U &&dofmaps, const std::vector< fem::CoordinateElement< typename std::remove_reference_t< typename V::value_type > > > &elements, V &&x, int dim, W &&input_global_indices)
Constructor of object that holds mesh geometry data.
Definition Geometry.h:69
md::mdspan< const std::int32_t, md::dextents< std::size_t, 2 > > dofmap() const
DofMap for the geometry.
Definition Geometry.h:112
const std::vector< std::int64_t > & input_global_indices() const
Global user indices.
Definition Geometry.h:176
std::span< const value_type > x() const
Access geometry degrees-of-freedom data (const version).
Definition Geometry.h:144
Geometry & operator=(const Geometry &)=delete
Copy assignment.
T value_type
Value type.
Definition Geometry.h:37
Topology stores the topology of a mesh, consisting of mesh entities and connectivity (incidence relat...
Definition Topology.h:49
const std::vector< std::uint32_t > & get_cell_permutation_info() const
Returns the permutation information.
Definition Topology.cpp:885
std::shared_ptr< const graph::AdjacencyList< std::int32_t > > connectivity(std::array< int, 2 > d0, std::array< int, 2 > d1) const
Get the connectivity from entities of topological dimension d0 to dimension d1.
Definition Topology.cpp:865
const std::vector< CellType > & entity_types(int dim) const
Entity types in the topology for a given dimension.
Definition Topology.cpp:808
int dim() const noexcept
Topological dimension of the mesh.
Definition Topology.cpp:803
std::vector< std::shared_ptr< const common::IndexMap > > index_maps(int dim) const
Get the index maps that described the parallel distribution of the mesh entities of a given topologic...
Definition Topology.cpp:831
std::tuple< common::IndexMap, int, std::vector< std::vector< std::int32_t > > > build_dofmap_data(MPI_Comm comm, const mesh::Topology &topology, const std::vector< ElementDofLayout > &element_dof_layouts, const std::function< std::vector< int >(const graph::AdjacencyList< std::int32_t > &)> &reorder_fn)
Definition dofmapbuilder.cpp:643
std::vector< std::int64_t > compute_local_to_global(std::span< const std::int64_t > global, std::span< const std::int32_t > local)
Definition partition.cpp:542
std::vector< std::int32_t > compute_local_to_local(std::span< const std::int64_t > local0_to_global, std::span< const std::int64_t > local1_to_global)
Compute a local0-to-local1 map from two local-to-global maps with common global indices.
Definition partition.cpp:564
Mesh data structures and algorithms on meshes.
Definition DofMap.h:32
Geometry< typename std::remove_reference_t< typename U::value_type > > create_geometry(const Topology &topology, const std::vector< fem::CoordinateElement< std::remove_reference_t< typename U::value_type > > > &elements, std::span< const std::int64_t > nodes, std::span< const std::int64_t > xdofs, const U &x, int dim, const std::function< std::vector< int >(const graph::AdjacencyList< std::int32_t > &)> &reorder_fn=nullptr)
Build Geometry from input data.
Definition Geometry.h:238