Skip to content
GitLab
Explore
Sign in
Register
Primary navigation
Search or go to…
Project
S
Scotty3D
Manage
Activity
Members
Labels
Plan
Issues
0
Issue boards
Milestones
Wiki
Code
Merge requests
0
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
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
Keyboard shortcuts
?
Snippets
Groups
Projects
Courses
Scotty3D
Commits
57f98ce1
Commit
57f98ce1
authored
4 years ago
by
TheNumbat
Browse files
Options
Downloads
Patches
Plain Diff
fix multi-boundary mesh loading
parent
768c19db
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
src/geometry/halfedge.cpp
+21
-18
21 additions, 18 deletions
src/geometry/halfedge.cpp
src/geometry/halfedge.h
+1
-0
1 addition, 0 deletions
src/geometry/halfedge.h
src/gui/model.cpp
+18
-14
18 additions, 14 deletions
src/gui/model.cpp
with
40 additions
and
32 deletions
src/geometry/halfedge.cpp
+
21
−
18
View file @
57f98ce1
...
@@ -28,6 +28,7 @@ void Halfedge_Mesh::clear() {
...
@@ -28,6 +28,7 @@ void Halfedge_Mesh::clear() {
faces
.
clear
();
faces
.
clear
();
boundaries
.
clear
();
boundaries
.
clear
();
render_dirty_flag
=
true
;
render_dirty_flag
=
true
;
next_id
=
Gui
::
n_Widget_IDs
;
}
}
void
Halfedge_Mesh
::
copy_to
(
Halfedge_Mesh
&
mesh
)
{
copy_to
(
mesh
,
0
);
}
void
Halfedge_Mesh
::
copy_to
(
Halfedge_Mesh
&
mesh
)
{
copy_to
(
mesh
,
0
);
}
...
@@ -42,10 +43,10 @@ Halfedge_Mesh::ElementRef Halfedge_Mesh::copy_to(Halfedge_Mesh &mesh, unsigned i
...
@@ -42,10 +43,10 @@ Halfedge_Mesh::ElementRef Halfedge_Mesh::copy_to(Halfedge_Mesh &mesh, unsigned i
// with elements of the new mesh. (Note that we can use a single
// with elements of the new mesh. (Note that we can use a single
// map for both interior and boundary faces, because the map
// map for both interior and boundary faces, because the map
// doesn't care which list of faces these iterators come from.)
// doesn't care which list of faces these iterators come from.)
std
::
unordered_map
<
HalfedgeCRef
,
HalfedgeRef
>
halfedgeOldToNew
(
n_halfedges
());
std
::
unordered_map
<
unsigned
int
,
HalfedgeRef
>
halfedgeOldToNew
(
n_halfedges
());
std
::
unordered_map
<
VertexCRef
,
VertexRef
>
vertexOldToNew
(
n_vertices
());
std
::
unordered_map
<
unsigned
int
,
VertexRef
>
vertexOldToNew
(
n_vertices
());
std
::
unordered_map
<
EdgeCRef
,
EdgeRef
>
edgeOldToNew
(
n_edges
());
std
::
unordered_map
<
unsigned
int
,
EdgeRef
>
edgeOldToNew
(
n_edges
());
std
::
unordered_map
<
FaceCRef
,
FaceRef
>
faceOldToNew
(
n_faces
());
std
::
unordered_map
<
unsigned
int
,
FaceRef
>
faceOldToNew
(
n_faces
());
// Copy geometry from the original mesh and create a map from
// Copy geometry from the original mesh and create a map from
// pointers in the original mesh to those in the new mesh.
// pointers in the original mesh to those in the new mesh.
...
@@ -53,49 +54,49 @@ Halfedge_Mesh::ElementRef Halfedge_Mesh::copy_to(Halfedge_Mesh &mesh, unsigned i
...
@@ -53,49 +54,49 @@ Halfedge_Mesh::ElementRef Halfedge_Mesh::copy_to(Halfedge_Mesh &mesh, unsigned i
auto
hn
=
mesh
.
halfedges
.
insert
(
mesh
.
halfedges
.
end
(),
*
h
);
auto
hn
=
mesh
.
halfedges
.
insert
(
mesh
.
halfedges
.
end
(),
*
h
);
if
(
h
->
id
()
==
eid
)
if
(
h
->
id
()
==
eid
)
ret
=
hn
;
ret
=
hn
;
halfedgeOldToNew
[
h
]
=
hn
;
halfedgeOldToNew
[
h
->
id
()
]
=
hn
;
}
}
for
(
VertexCRef
v
=
vertices_begin
();
v
!=
vertices_end
();
v
++
)
{
for
(
VertexCRef
v
=
vertices_begin
();
v
!=
vertices_end
();
v
++
)
{
auto
vn
=
mesh
.
vertices
.
insert
(
mesh
.
vertices
.
end
(),
*
v
);
auto
vn
=
mesh
.
vertices
.
insert
(
mesh
.
vertices
.
end
(),
*
v
);
if
(
v
->
id
()
==
eid
)
if
(
v
->
id
()
==
eid
)
ret
=
vn
;
ret
=
vn
;
vertexOldToNew
[
v
]
=
vn
;
vertexOldToNew
[
v
->
id
()
]
=
vn
;
}
}
for
(
EdgeCRef
e
=
edges_begin
();
e
!=
edges_end
();
e
++
)
{
for
(
EdgeCRef
e
=
edges_begin
();
e
!=
edges_end
();
e
++
)
{
auto
en
=
mesh
.
edges
.
insert
(
mesh
.
edges
.
end
(),
*
e
);
auto
en
=
mesh
.
edges
.
insert
(
mesh
.
edges
.
end
(),
*
e
);
if
(
e
->
id
()
==
eid
)
if
(
e
->
id
()
==
eid
)
ret
=
en
;
ret
=
en
;
edgeOldToNew
[
e
]
=
en
;
edgeOldToNew
[
e
->
id
()
]
=
en
;
}
}
for
(
FaceCRef
f
=
faces_begin
();
f
!=
faces_end
();
f
++
)
{
for
(
FaceCRef
f
=
faces_begin
();
f
!=
faces_end
();
f
++
)
{
auto
fn
=
mesh
.
faces
.
insert
(
mesh
.
faces
.
end
(),
*
f
);
auto
fn
=
mesh
.
faces
.
insert
(
mesh
.
faces
.
end
(),
*
f
);
if
(
f
->
id
()
==
eid
)
if
(
f
->
id
()
==
eid
)
ret
=
fn
;
ret
=
fn
;
faceOldToNew
[
f
]
=
fn
;
faceOldToNew
[
f
->
id
()
]
=
fn
;
}
}
for
(
FaceCRef
b
=
boundaries_begin
();
b
!=
boundaries_end
();
b
++
)
{
for
(
FaceCRef
b
=
boundaries_begin
();
b
!=
boundaries_end
();
b
++
)
{
auto
bn
=
mesh
.
boundaries
.
insert
(
mesh
.
boundaries
.
end
(),
*
b
);
auto
bn
=
mesh
.
boundaries
.
insert
(
mesh
.
boundaries
.
end
(),
*
b
);
if
(
b
->
id
()
==
eid
)
if
(
b
->
id
()
==
eid
)
ret
=
bn
;
ret
=
bn
;
faceOldToNew
[
b
]
=
bn
;
faceOldToNew
[
b
->
id
()
]
=
bn
;
}
}
// "Search and replace" old pointers with new ones.
// "Search and replace" old pointers with new ones.
for
(
HalfedgeRef
he
=
mesh
.
halfedges_begin
();
he
!=
mesh
.
halfedges_end
();
he
++
)
{
for
(
HalfedgeRef
he
=
mesh
.
halfedges_begin
();
he
!=
mesh
.
halfedges_end
();
he
++
)
{
he
->
next
()
=
halfedgeOldToNew
[
he
->
next
()];
he
->
next
()
=
halfedgeOldToNew
[
he
->
next
()
->
id
()
];
he
->
twin
()
=
halfedgeOldToNew
[
he
->
twin
()];
he
->
twin
()
=
halfedgeOldToNew
[
he
->
twin
()
->
id
()
];
he
->
vertex
()
=
vertexOldToNew
[
he
->
vertex
()];
he
->
vertex
()
=
vertexOldToNew
[
he
->
vertex
()
->
id
()
];
he
->
edge
()
=
edgeOldToNew
[
he
->
edge
()];
he
->
edge
()
=
edgeOldToNew
[
he
->
edge
()
->
id
()
];
he
->
face
()
=
faceOldToNew
[
he
->
face
()];
he
->
face
()
=
faceOldToNew
[
he
->
face
()
->
id
()
];
}
}
for
(
VertexRef
v
=
mesh
.
vertices_begin
();
v
!=
mesh
.
vertices_end
();
v
++
)
for
(
VertexRef
v
=
mesh
.
vertices_begin
();
v
!=
mesh
.
vertices_end
();
v
++
)
v
->
halfedge
()
=
halfedgeOldToNew
[
v
->
halfedge
()];
v
->
halfedge
()
=
halfedgeOldToNew
[
v
->
halfedge
()
->
id
()
];
for
(
EdgeRef
e
=
mesh
.
edges_begin
();
e
!=
mesh
.
edges_end
();
e
++
)
for
(
EdgeRef
e
=
mesh
.
edges_begin
();
e
!=
mesh
.
edges_end
();
e
++
)
e
->
halfedge
()
=
halfedgeOldToNew
[
e
->
halfedge
()];
e
->
halfedge
()
=
halfedgeOldToNew
[
e
->
halfedge
()
->
id
()
];
for
(
FaceRef
f
=
mesh
.
faces_begin
();
f
!=
mesh
.
faces_end
();
f
++
)
for
(
FaceRef
f
=
mesh
.
faces_begin
();
f
!=
mesh
.
faces_end
();
f
++
)
f
->
halfedge
()
=
halfedgeOldToNew
[
f
->
halfedge
()];
f
->
halfedge
()
=
halfedgeOldToNew
[
f
->
halfedge
()
->
id
()
];
for
(
FaceRef
b
=
mesh
.
boundaries_begin
();
b
!=
mesh
.
boundaries_end
();
b
++
)
for
(
FaceRef
b
=
mesh
.
boundaries_begin
();
b
!=
mesh
.
boundaries_end
();
b
++
)
b
->
halfedge
()
=
halfedgeOldToNew
[
b
->
halfedge
()];
b
->
halfedge
()
=
halfedgeOldToNew
[
b
->
halfedge
()
->
id
()
];
mesh
.
render_dirty_flag
=
true
;
mesh
.
render_dirty_flag
=
true
;
mesh
.
next_id
=
next_id
;
mesh
.
next_id
=
next_id
;
...
@@ -467,6 +468,8 @@ bool Halfedge_Mesh::subdivide(SubD strategy) {
...
@@ -467,6 +468,8 @@ bool Halfedge_Mesh::subdivide(SubD strategy) {
}
break
;
}
break
;
case
SubD
::
loop
:
{
case
SubD
::
loop
:
{
if
(
boundaries
.
size
())
return
false
;
for
(
FaceRef
f
=
faces_begin
();
f
!=
faces_end
();
f
++
)
{
for
(
FaceRef
f
=
faces_begin
();
f
!=
faces_end
();
f
++
)
{
if
(
f
->
degree
()
!=
3
)
if
(
f
->
degree
()
!=
3
)
return
false
;
return
false
;
...
...
This diff is collapsed.
Click to expand it.
src/geometry/halfedge.h
+
1
−
0
View file @
57f98ce1
...
@@ -508,6 +508,7 @@ public:
...
@@ -508,6 +508,7 @@ public:
Size
n_vertices
()
const
{
return
vertices
.
size
();
};
Size
n_vertices
()
const
{
return
vertices
.
size
();
};
Size
n_edges
()
const
{
return
edges
.
size
();
};
Size
n_edges
()
const
{
return
edges
.
size
();
};
Size
n_faces
()
const
{
return
faces
.
size
();
};
Size
n_faces
()
const
{
return
faces
.
size
();
};
Size
n_boundaries
()
const
{
return
boundaries
.
size
();
};
Size
n_halfedges
()
const
{
return
halfedges
.
size
();
};
Size
n_halfedges
()
const
{
return
halfedges
.
size
();
};
/// Check if half-edge mesh is valid
/// Check if half-edge mesh is valid
...
...
This diff is collapsed.
Click to expand it.
src/gui/model.cpp
+
18
−
14
View file @
57f98ce1
...
@@ -62,24 +62,30 @@ void Model::update_vertex(Halfedge_Mesh::VertexRef vert) {
...
@@ -62,24 +62,30 @@ void Model::update_vertex(Halfedge_Mesh::VertexRef vert) {
vertex_viz
(
v
,
d
,
vi
.
transform
);
vertex_viz
(
v
,
d
,
vi
.
transform
);
vert_sizes
[
v
->
id
()]
=
d
;
vert_sizes
[
v
->
id
()]
=
d
;
size_t
idx
=
id_to_info
[
h
->
face
()
->
id
()].
instance
;
if
(
!
h
->
face
()
->
is_boundary
())
{
face_viz
(
h
->
face
(),
face_mesh
.
edit_verts
(),
face_mesh
.
edit_indices
(),
idx
);
size_t
idx
=
id_to_info
[
h
->
face
()
->
id
()].
instance
;
face_viz
(
h
->
face
(),
face_mesh
.
edit_verts
(),
face_mesh
.
edit_indices
(),
idx
);
Halfedge_Mesh
::
HalfedgeRef
fh
=
h
->
face
()
->
halfedge
();
do
{
Halfedge_Mesh
::
HalfedgeRef
fh
=
h
->
face
()
->
halfedge
();
halfedge_viz
(
fh
,
arrows
.
get
(
id_to_info
[
fh
->
id
()].
instance
).
transform
);
do
{
fh
=
fh
->
next
();
halfedge_viz
(
fh
,
arrows
.
get
(
id_to_info
[
fh
->
id
()].
instance
).
transform
);
}
while
(
fh
!=
h
->
face
()
->
halfedge
());
fh
=
fh
->
next
();
}
while
(
fh
!=
h
->
face
()
->
halfedge
());
}
h
=
h
->
twin
()
->
next
();
h
=
h
->
twin
()
->
next
();
}
while
(
h
!=
vert
->
halfedge
());
}
while
(
h
!=
vert
->
halfedge
());
// Update surrounding halfedges & edges
// Update surrounding halfedges & edges
do
{
do
{
GL
::
Instances
::
Info
&
hi
=
arrows
.
get
(
id_to_info
[
h
->
id
()].
instance
);
if
(
!
h
->
is_boundary
())
{
halfedge_viz
(
h
,
hi
.
transform
);
GL
::
Instances
::
Info
&
hi
=
arrows
.
get
(
id_to_info
[
h
->
id
()].
instance
);
GL
::
Instances
::
Info
&
thi
=
arrows
.
get
(
id_to_info
[
h
->
twin
()
->
id
()].
instance
);
halfedge_viz
(
h
,
hi
.
transform
);
halfedge_viz
(
h
->
twin
(),
thi
.
transform
);
}
if
(
!
h
->
twin
()
->
is_boundary
())
{
GL
::
Instances
::
Info
&
thi
=
arrows
.
get
(
id_to_info
[
h
->
twin
()
->
id
()].
instance
);
halfedge_viz
(
h
->
twin
(),
thi
.
transform
);
}
GL
::
Instances
::
Info
&
e
=
cylinders
.
get
(
id_to_info
[
h
->
edge
()
->
id
()].
instance
);
GL
::
Instances
::
Info
&
e
=
cylinders
.
get
(
id_to_info
[
h
->
edge
()
->
id
()].
instance
);
edge_viz
(
h
->
edge
(),
e
.
transform
);
edge_viz
(
h
->
edge
(),
e
.
transform
);
...
@@ -375,8 +381,6 @@ void Model::rebuild() {
...
@@ -375,8 +381,6 @@ void Model::rebuild() {
std
::
vector
<
GL
::
Mesh
::
Index
>
idxs
;
std
::
vector
<
GL
::
Mesh
::
Index
>
idxs
;
for
(
auto
f
=
mesh
.
faces_begin
();
f
!=
mesh
.
faces_end
();
f
++
)
{
for
(
auto
f
=
mesh
.
faces_begin
();
f
!=
mesh
.
faces_end
();
f
++
)
{
if
(
f
->
is_boundary
())
continue
;
face_viz
(
f
,
verts
,
idxs
,
verts
.
size
());
face_viz
(
f
,
verts
,
idxs
,
verts
.
size
());
}
}
face_mesh
.
recreate
(
std
::
move
(
verts
),
std
::
move
(
idxs
));
face_mesh
.
recreate
(
std
::
move
(
verts
),
std
::
move
(
idxs
));
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
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