Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
U
Unterteilungsalgorithmen
Project
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
3
Issues
3
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Kai Westerkamp
Unterteilungsalgorithmen
Commits
7e535564
Commit
7e535564
authored
8 years ago
by
Philipp Adolf
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Make code compile with g++
parent
04d2f796
patchRender
…
hack
master
sharpEdges
No related merge requests found
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
3 deletions
+3
-3
subdivision.cpp
QTProject/subdivision.cpp
+3
-3
No files found.
QTProject/subdivision.cpp
View file @
7e535564
...
...
@@ -73,7 +73,7 @@ void Subdivision::precomputeTables(Mesh *mesh) {
//compute edge table
//Format: first two entries: edge vertices. last two entries: distant vertices.
QVector
<
QVector
<
unsigned
int
>>
edgeIndices_base
;
QVector
<
QVector
<
unsigned
int
>
>
edgeIndices_base
;
for
(
int
i
=
0
;
i
<
ib
.
length
();
i
+=
3
){
//schaue alle dreiecke an
...
...
@@ -148,8 +148,8 @@ void Subdivision::precomputeTables(Mesh *mesh) {
//compute vertex table
//Format: First entry: original vertex. Other entries: adjacent vertices.
QVector
<
QVector
<
unsigned
int
>>
vertexIndices_base
;
QVector
<
QVector
<
unsigned
int
>>
duplicates
;
//for debugging
QVector
<
QVector
<
unsigned
int
>
>
vertexIndices_base
;
QVector
<
QVector
<
unsigned
int
>
>
duplicates
;
//for debugging
for
(
unsigned
int
i
=
0
;
i
<
vb
.
length
();
i
++
){
//hat evtl viel redundanz
...
...
This diff is collapsed.
Click to expand it.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment