Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
gmsh
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Larry Price
gmsh
Commits
70fc390b
Commit
70fc390b
authored
8 years ago
by
Jean-François Remacle
Browse files
Options
Downloads
Patches
Plain Diff
oops
parent
df002236
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
Mesh/meshDiscreteRegion.cpp
+93
-0
93 additions, 0 deletions
Mesh/meshDiscreteRegion.cpp
with
93 additions
and
0 deletions
Mesh/meshDiscreteRegion.cpp
0 → 100644
+
93
−
0
View file @
70fc390b
#include
<stdlib.h>
#include
<vector>
// general
#include
"OS.h"
#include
"Geo.h"
#include
"Context.h"
#include
"GmshConfig.h"
#include
"GmshMessage.h"
#include
"fullMatrix.h"
// mesh
#include
"meshGFaceOptimize.h"
#include
"meshGRegionBoundaryRecovery.h"
#include
"meshGRegionDelaunayInsertion.h"
#include
"meshGRegionRelocateVertex.h"
#include
"delaunay3d.h"
// model
#include
"GModel.h"
#include
"GRegion.h"
#include
"GFace.h"
#include
"discreteFace.h"
#include
"discreteRegion.h"
// elements
#include
"MLine.h"
#include
"MTriangle.h"
#include
"MTetrahedron.h"
#include
"MPyramid.h"
#include
"MPrism.h"
#include
"MHexahedron.h"
// triangles are defining the boundary
// internal points are allowed
// This has been done for HEXTREME
GRegion
*
createDiscreteRegionFromRawData
(
GModel
*
gm
,
fullMatrix
<
double
>
&
pts
,
fullMatrix
<
int
>
&
triangles
)
{
GRegion
*
gr
=
new
discreteRegion
(
gm
,
NEWREG
());
GFace
*
gf
=
new
discreteFace
(
gm
,
NEWREG
());
gm
->
add
(
gr
);
gm
->
add
(
gf
);
std
::
list
<
GFace
*>
faces
;
faces
.
push_back
(
gf
)
;
gr
->
set
(
faces
);
// get boundary nodes
std
::
set
<
int
>
bnd
;
int
nbTriangles
=
triangles
.
size1
();
int
nbPts
=
pts
.
size1
();
for
(
unsigned
int
i
=
0
;
i
<
nbTriangles
;
i
++
)
{
bnd
.
insert
(
triangles
(
i
,
0
));
bnd
.
insert
(
triangles
(
i
,
1
));
bnd
.
insert
(
triangles
(
i
,
2
));
}
// create points
std
::
vector
<
MVertex
*>
vs
(
nbPts
);
for
(
unsigned
int
i
=
0
;
i
<
nbPts
;
i
++
)
{
if
(
bnd
.
find
(
i
)
==
bnd
.
end
()){
MVertex
*
v
=
new
MVertex
(
pts
(
i
,
0
),
pts
(
i
,
1
),
pts
(
i
,
2
),
gr
);
gr
->
mesh_vertices
.
push_back
(
v
);
vs
[
i
]
=
v
;
}
else
{
MVertex
*
v
=
new
MFaceVertex
(
pts
(
i
,
0
),
pts
(
i
,
1
),
pts
(
i
,
2
),
gr
,
0
,
0
);
gr
->
mesh_vertices
.
push_back
(
v
);
vs
[
i
]
=
v
;
}
}
// create triangles
for
(
unsigned
int
i
=
0
;
i
<
nbTriangles
;
i
++
)
{
int
i0
=
triangles
(
i
,
0
);
int
i1
=
triangles
(
i
,
1
);
int
i2
=
triangles
(
i
,
2
);
MTriangle
*
t
=
new
MTriangle
(
vs
[
i0
],
vs
[
i1
],
vs
[
i2
]);
gf
->
triangles
.
push_back
(
t
);
}
delaunayTriangulation
(
1
,
1
,
vs
,
gr
->
tetrahedra
);
return
gr
;
}
GRegion
*
createTetrahedralMesh
(
GModel
*
gm
,
fullMatrix
<
double
>
&
pts
,
fullMatrix
<
int
>
&
triangles
)
{
GRegion
*
gr
=
createDiscreteRegionFromRawData
(
gm
,
pts
,
triangles
);
try
{
meshGRegionBoundaryRecovery
(
gr
);
}
catch
(
int
err
){
if
(
err
==
3
){
Msg
::
Warning
(
"Self-intersecting surface mesh: TODO!"
);
}
else
{
Msg
::
Error
(
"Could not recover boundary: error %d"
,
err
);
}
}
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment