Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Allow coloring subsets of cells #402

Merged
merged 5 commits into from
Jan 6, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions docs/src/reference/export.md
Original file line number Diff line number Diff line change
Expand Up @@ -27,4 +27,5 @@ vtk_grid(filename::AbstractString, grid::Grid{dim,C,T}; compress::Bool) where {d
vtk_point_data(vtk::WriteVTK.DatasetFile, data::Union{Vector{SymmetricTensor{2,dim,T,M}}},name::AbstractString) where {dim,T,M}
vtk_point_data(vtk::WriteVTK.DatasetFile, data::Union{ Vector{Tensor{order,dim,T,M}}, Vector{SymmetricTensor{order,dim,T,M}}}, name::AbstractString) where {order,dim,T,M}
vtk_cellset
vtk_cell_data_colors
```
6 changes: 5 additions & 1 deletion docs/src/reference/grid.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,4 +2,8 @@
DocTestSetup = :(using Ferrite)
```

# Grid
# Grid
## Multithreaded Assembly
```@docs
create_coloring
```
77 changes: 44 additions & 33 deletions src/Grid/coloring.jl
Original file line number Diff line number Diff line change
@@ -1,7 +1,8 @@
# Incidence matrix for element connections in the grid
function create_incidence_matrix(g::Grid)
function create_incidence_matrix(g::Grid, cellset::Set{Int}=Set{Int}(1:getncells(g)))
cell_containing_node = Dict{Int, Set{Int}}()
for (cellid, cell) in enumerate(g.cells)
for cellid in cellset
cell = getcells(g, cellid)
for v in cell.nodes
if !haskey(cell_containing_node, v)
cell_containing_node[v] = Set{Int}()
Expand Down Expand Up @@ -68,35 +69,42 @@ function greedy_coloring(incidence_matrix, cells=1:size(incidence_matrix, 1))
end

# See Appendix A in https://www.math.colostate.edu/%7Ebangerth/publications/2013-pattern.pdf
function workstream_coloring(incidence_matrix)
function workstream_coloring(incidence_matrix, cellset::Set{Int})
###################
# 1. Partitioning #
###################
zones = Set{Int}[]
## Zone 1: Just the first element
push!(zones, Set{Int}(1))
Z = 2
n_visited = 0
Z = 1
Z0 = Set{Int}() # Dummy zone
n_visited = 1
## Zone N: All elements with connection to elements in Zone N-1
while true
s = Set{Int}()
# Loop over all elements in previous zone and add their neigbouring elements
# unless they are in any of the previous 2 zones.
for c in get(zones, Z-1, Z0)
for r in nzrange(incidence_matrix, c)
cell_neighbour = incidence_matrix.rowval[r]
if !(cell_neighbour in get(zones, Z-2, Z0) || cell_neighbour in get(zones, Z-1, Z0))
push!(s, cell_neighbour)
while n_visited < length(cellset)
remaining_cellset = setdiff(cellset, zones...)
## Zone 1: Just the first element
push!(zones, Set{Int}(first(remaining_cellset)))
Z += 1
n_visited += 1
## Zone N: All elements with connection to elements in Zone N-1
while true
s = Set{Int}()
# Loop over all elements in previous zone and add their neigbouring elements
# unless they are in any of the previous 2 zones.
empty_zone = true
for c in get(zones, Z-1, Z0)
c ∈ cellset || continue # technically not needed as long as incidence matrix is created with cellset
for r in nzrange(incidence_matrix, c)
cell_neighbour = incidence_matrix.rowval[r]
if !(cell_neighbour in get(zones, Z-2, Z0) || cell_neighbour in get(zones, Z-1, Z0))
push!(s, cell_neighbour)
empty_zone = false
end
end
end
empty_zone && break # no more cells connected to previous zone

push!(zones, s)
n_visited += length(s)
Z += 1
end
push!(zones, s)
n_visited += length(s)
if n_visited >= size(incidence_matrix, 1)
break
end
Z += 1
end

###############
Expand Down Expand Up @@ -140,10 +148,10 @@ end
@enum ColoringAlgorithm GREEDY WORKSTREAM

"""
create_coloring(g::Grid; alg::ColoringAlgorithm)
create_coloring(g::Grid, cellset::Set{Int}=Set(1:getncells(g)); alg::ColoringAlgorithm)

Create a coloring of the cells in grid `g` such that no neighboring cells
have the same color.
have the same color. If only a subset of cells should be colored, the cells to color can be specified by `cellset`.

Returns a vector of vectors with cell indexes, e.g.:

Expand All @@ -157,9 +165,10 @@ ret = [
Two different algorithms are available, specified with the `alg` keyword argument:
- `alg = Ferrite.WORKSTREAM` (default): Three step algorithm from
[*WorkStream*](https://www.math.colostate.edu/%7Ebangerth/publications/2013-pattern.pdf)
, albeit with a greedy coloring in the second step.
- `alg = Ferrite.GREEDY`: greedy algorithm that works well for structured grid such as
e.g. grids from `generate_grid`.
, albeit with a greedy coloring in the second step. Generally results in more colors than `Ferrite.GREEDY`,
however the cells are more equally distributed among the colors.
- `alg = Ferrite.GREEDY`: greedy algorithm that works well for structured quadrilateral grids such as
e.g. quadrilateral grids from `generate_grid`.

The resulting colors can be visualized using [`vtk_cell_data_colors`](@ref).

Expand All @@ -174,12 +183,12 @@ The resulting colors can be visualized using [`vtk_cell_data_colors`](@ref).
)
```
"""
function create_coloring(g::Grid; alg::ColoringAlgorithm=WORKSTREAM)
incidence_matrix = create_incidence_matrix(g)
function create_coloring(g::Grid, cellset::Set{Int}=Set{Int}(1:getncells(g)); alg::ColoringAlgorithm=WORKSTREAM)
incidence_matrix = create_incidence_matrix(g, cellset)
if alg === WORKSTREAM
return workstream_coloring(incidence_matrix)
return workstream_coloring(incidence_matrix, cellset)
elseif alg === GREEDY
return greedy_coloring(incidence_matrix)
return greedy_coloring(incidence_matrix, cellset)
else
error("impossible")
end
Expand All @@ -189,9 +198,11 @@ end
vtk_cell_data_colors(vtkfile, cell_colors, name="coloring")

Write cell colors (see [`create_coloring`](@ref)) to a VTK file for visualization.

In case of coloring a subset, the cells which are not part of the subset are represented as color 0.
"""
function vtk_cell_data_colors(vtkfile, cell_colors::AbstractVector{<:AbstractVector{<:Integer}}, name="coloring")
color_vector = zeros(sum(length, cell_colors))
color_vector = zeros(Int, vtkfile.Ncls)
for (i, cells_color) in enumerate(cell_colors)
for cell in cells_color
color_vector[cell] = i
Expand Down
19 changes: 14 additions & 5 deletions test/test_grid_dofhandler_vtk.jl
Original file line number Diff line number Diff line change
Expand Up @@ -216,12 +216,12 @@ end
end

@testset "grid coloring" begin
function test_coloring(grid)
function test_coloring(grid, cellset=Set(1:getncells(grid)))
for alg in (Ferrite.GREEDY, Ferrite.WORKSTREAM)
color_vectors = create_coloring(grid; alg=alg)
@test sum(length, color_vectors) == getncells(grid)
@test union(Set.(color_vectors)...) == Set(1:getncells(grid))
conn = Ferrite.create_incidence_matrix(grid)
color_vectors = create_coloring(grid, cellset; alg=alg)
@test sum(length, color_vectors) == length(cellset)
@test union(Set.(color_vectors)...) == cellset
conn = Ferrite.create_incidence_matrix(grid, cellset)
for color in color_vectors, c1 in color, c2 in color
@test !conn[c1, c2]
end
Expand All @@ -237,4 +237,13 @@ end
# test_coloring(generate_grid(QuadraticTetrahedron, (5, 5, 5)))
test_coloring(generate_grid(Hexahedron, (5, 5, 5)))
# test_coloring(generate_grid(QuadraticHexahedron, (5, 5, 5)))

# color only a subset
test_coloring(generate_grid(Line, (5,)), Set{Int}(1:3))
test_coloring(generate_grid(Triangle, (5, 5)), Set{Int}(1:3^2))
test_coloring(generate_grid(Quadrilateral, (5, 5)), Set{Int}(1:3^2))
test_coloring(generate_grid(Tetrahedron, (5, 5, 5)), Set{Int}(1:3^3))
test_coloring(generate_grid(Hexahedron, (5, 5, 5)), Set{Int}(1:3^3))
# unconnected subset
test_coloring(generate_grid(Triangle, (10, 10)), union(Set(1:10), Set(70:80)))
end