Mercurial > repos > public > sbplib_julia
annotate src/Grids/manifolds.jl @ 1571:c2620118f110 feature/grids/manifolds
Merge feature/grids/curvilinear
author | Jonatan Werpers <jonatan@werpers.com> |
---|---|
date | Thu, 25 Apr 2024 14:00:40 +0200 |
parents | 90af15f38c62 |
children | 157c43966b06 |
rev | line source |
---|---|
1558 | 1 """ |
2 ParameterSpace{D} | |
3 | |
4 A space of parameters of dimension `D`. Used with `Chart` to indicate which | |
5 parameters are valid for that chart. | |
6 | |
7 Common parameter spaces are created using the functions unit sized spaces | |
8 * `unitinterval` | |
9 * `unitrectangle` | |
10 * `unitbox` | |
11 * `unittriangle` | |
12 * `unittetrahedron` | |
13 * `unithyperbox` | |
14 * `unitsimplex` | |
15 | |
16 See also: [`Interval`](@ref), [`Rectangle`](@ref), [`Box`](@ref), | |
17 [`Triangle`](@ref), [`Tetrahedron`](@ref), [`HyperBox`](@ref), | |
18 [`Simplex`](@ref), | |
19 """ | |
20 abstract type ParameterSpace{D} end | |
21 | |
22 struct HyperBox{T,D} <: ParameterSpace{D} | |
23 a::SVector{D,T} | |
24 b::SVector{D,T} | |
25 end | |
26 | |
27 function HyperBox(a,b) | |
28 T = SVector{length(a)} | |
29 HyperBox(convert(T,a), convert(T,b)) | |
30 end | |
31 | |
32 Interval{T} = HyperBox{T,1} | |
33 Rectangle{T} = HyperBox{T,2} | |
34 Box{T} = HyperBox{T,3} | |
35 | |
36 limits(box::HyperBox, d) = (box.a[d], box.b[d]) | |
37 limits(box::HyperBox) = (box.a, box.b) | |
38 | |
39 unitinterval(T=Float64) = unithyperbox(T,1) | |
40 unitsquare(T=Float64) = unithyperbox(T,2) | |
41 unitcube(T=Float64) = unithyperbox(T,3) | |
42 unithyperbox(T, D) = HyperBox((@SVector zeros(T,D)), (@SVector ones(T,D))) | |
43 unithyperbox(D) = unithyperbox(Float64,D) | |
44 | |
45 | |
46 struct Simplex{T,D} <: ParameterSpace{D} | |
47 verticies::NTuple{D,SVector{D,T}} | |
48 end | |
49 | |
1564
35fe4375b35f
Export things and fix ConcreteChart and Simplex
Jonatan Werpers <jonatan@werpers.com>
parents:
1558
diff
changeset
|
50 Simplex(verticies::Vararg{AbstractArray}) = Simplex(Tuple(SVector(v...) for v ∈ verticies)) |
35fe4375b35f
Export things and fix ConcreteChart and Simplex
Jonatan Werpers <jonatan@werpers.com>
parents:
1558
diff
changeset
|
51 |
1558 | 52 Triangle{T} = Simplex{T,2} |
53 Tetrahedron{T} = Simplex{T,3} | |
54 | |
55 unittriangle(T) = unitsimplex(T,2) | |
56 unittetrahedron(T) = unitsimplex(T,3) | |
57 function unitsimplex(T,D) | |
58 z = @SVector zeros(T,D) | |
59 unitelement = one(eltype(z)) | |
60 verticies = ntuple(i->setindex(z, unitelement, i), 4) | |
61 return Simplex(verticies) | |
62 end | |
63 | |
64 | |
65 """ | |
66 | |
67 A parametrized description of a manifold or part of a manifold. | |
68 | |
69 Should implement a methods for | |
70 * `parameterspace` | |
71 * `(::Chart)(ξs...)` | |
72 | |
73 There is a default implementation for `(::Chart{D})(::SVector{D})` | |
74 """ | |
75 abstract type Chart{D} end | |
76 # abstract type Chart{D,R} end | |
77 | |
78 domain_dim(::Chart{D}) where D = D | |
79 # range_dim(::Chart{D,R}) where {D,R} = R | |
80 | |
81 """ | |
82 The parameterspace of a chart | |
83 """ | |
84 function parameterspace end | |
85 | |
86 (c::Chart{D})(x̄::SVector{D}) where D = c(x̄...) | |
87 | |
88 | |
1568 | 89 # TODO: Add trait for if there is a jacobian available? |
90 # Add package extension to allow calling the getter function anyway if it's not available | |
91 # And can we add an informative error that ForwardDiff could be loaded to make it work? | |
92 # Or can we handle this be custom implementations? For sometypes in the library it can be implemented explicitly. | |
93 # And as an example for ConcreteChart it can be implemented by the user like | |
94 # c = ConcreteChart(...) | |
95 # jacobian(c::typeof(c)) = ... | |
96 | |
1564
35fe4375b35f
Export things and fix ConcreteChart and Simplex
Jonatan Werpers <jonatan@werpers.com>
parents:
1558
diff
changeset
|
97 struct ConcreteChart{D, PST<:ParameterSpace{D}, MT} <: Chart{D} |
35fe4375b35f
Export things and fix ConcreteChart and Simplex
Jonatan Werpers <jonatan@werpers.com>
parents:
1558
diff
changeset
|
98 mapping::MT |
1558 | 99 parameterspace::PST |
100 end | |
101 | |
102 (c::Chart)(x̄) = c.mapping(x̄) | |
103 | |
104 | |
105 """ | |
106 Atlas | |
107 | |
108 A collection of charts and their connections. | |
109 Should implement methods for `charts` and | |
110 """ | |
111 abstract type Atlas end | |
112 | |
113 """ | |
114 charts(::Atlas) | |
115 | |
116 The colloction of charts in the atlas. | |
117 """ | |
118 function charts end | |
119 | |
120 """ | |
121 connections | |
122 | |
123 TBD: What exactly should this return? | |
124 | |
125 """ | |
126 | |
127 struct CartesianAtlas <: Atlas | |
128 charts::Matrix{Chart} | |
129 end | |
130 | |
131 charts(a::CartesianAtlas) = a.charts | |
132 | |
133 struct UnstructuredAtlas <: Atlas | |
134 charts::Vector{Chart} | |
135 connections | |
136 end | |
137 | |
138 charts(a::UnstructuredAtlas) = a.charts | |
139 | |
140 | |
141 ### | |
142 # Geometry | |
143 ### | |
144 | |
145 abstract type Curve end | |
146 abstract type Surface end | |
147 | |
148 | |
149 struct Line{PT} <: Curve | |
150 p::PT | |
151 tangent::PT | |
152 end | |
153 | |
154 (c::Line)(s) = c.p + s*c.tangent | |
155 | |
156 | |
157 struct LineSegment{PT} <: Curve | |
158 a::PT | |
159 b::PT | |
160 end | |
161 | |
162 (c::LineSegment)(s) = (1-s)*c.a + s*c.b | |
163 | |
164 | |
165 struct Circle{T,PT} <: Curve | |
166 c::PT | |
167 r::T | |
168 end | |
169 | |
170 (c::Circle)(θ) = c.c + r*@SVector[cos(Θ), sin(Θ)] | |
171 | |
172 struct TransfiniteInterpolationSurface{T1,T2,T3,T4} <: Surface | |
173 c₁::T1 | |
174 c₂::T2 | |
175 c₃::T3 | |
176 c₄::T4 | |
177 end | |
178 | |
179 function (s::TransfiniteInterpolationSurface)(u,v) | |
180 c₁, c₂, c₃, c₄ = s.c₁, s.c₂, s.c₃, s.c₄ | |
181 P₀₀ = c₁(0) | |
182 P₁₀ = c₂(0) | |
183 P₁₁ = c₃(0) | |
184 P₀₁ = c₄(0) | |
185 return (1-v)*c₁(u) + u*c₂(v) + v*c₃(1-u) + (1-u)*c₄(1-v) - ( | |
186 (1-u)*(1-v)*P₀₀ + u*(1-v)*P₁₀ + u*v*P₁₁ + (1-u)*v*P₀₁ | |
187 ) | |
188 end | |
189 | |
190 function (s::TransfiniteInterpolationSurface)(ξ̄::AbstractArray) | |
191 s(ξ̄...) | |
192 end | |
193 | |
194 | |
195 function polygon_sides(Ps...) | |
196 n = length(Ps) | |
197 return [t->line(t,Ps[i],Ps[mod1(i+1,n)]) for i ∈ eachindex(Ps)] | |
198 end |