Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Q
Quadtree
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
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
fabian.troller
Quadtree
Commits
8276289a
Commit
8276289a
authored
4 years ago
by
poulpe
Browse files
Options
Downloads
Patches
Plain Diff
[Update] Add symmetry function with quadtree (horiz,vertical,central)
parent
9b664000
No related branches found
No related tags found
No related merge requests found
Changes
3
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
main.c
+2
-1
2 additions, 1 deletion
main.c
quadtree.c
+34
-29
34 additions, 29 deletions
quadtree.c
quadtree.h
+9
-1
9 additions, 1 deletion
quadtree.h
with
45 additions
and
31 deletions
main.c
+
2
−
1
View file @
8276289a
...
...
@@ -30,6 +30,7 @@ int main()
// matrix_alloc(&mat,p->pixels.lin,p->pixels.col);
// matrix_init(&mat);
quadtree_central_symetry
(
tree
);
quadtree_tree2matrix
(
tree
,
&
pp
->
pixels
);
// // matrix_print(mat);
...
...
@@ -42,7 +43,7 @@ int main()
matrix_destroy
(
&
p
->
pixels
);
matrix_destroy
(
&
pp
->
pixels
);
quadtree_tree_destroy
_clean
(
&
tree
);
quadtree_tree_destroy
(
&
tree
);
free
(
p
);
free
(
pp
);
return
0
;
...
...
This diff is collapsed.
Click to expand it.
quadtree.c
+
34
−
29
View file @
8276289a
...
...
@@ -154,36 +154,41 @@ void quadtree_tree2matrix(node *tree, matrix *mat)
}
}
void
quadtree_vertical_symetry
(
node
*
tree
)
{
// Inversé les colones
}
// OK
void
quadtree_horizontal_symetry
(
node
*
tree
)
{
}
void
quadtree_central_symetry
(
node
*
tree
)
if
(
NULL
!=
tree
)
{
for
(
uint32_t
i
=
0
;
i
<
CHILDREN
;
i
+=
1
)
{
quadtree_horizontal_symetry
(
tree
->
child
[
i
]);
}
quadtree_swap
((
void
**
)
&
tree
->
child
[
0
],
(
void
**
)
&
tree
->
child
[
1
]);
quadtree_swap
((
void
**
)
&
tree
->
child
[
2
],
(
void
**
)
&
tree
->
child
[
3
]);
}
}
void
quadtree_tree_destroy
(
node
**
tree
)
{
node
*
a
=
*
tree
;
if
(
a
->
child
[
0
]
==
NULL
)
// OK
void
quadtree_vertical_symetry
(
node
*
tree
)
{
free
(
a
);
}
else
if
(
NULL
!=
tree
)
{
for
(
uint32_t
i
=
0
;
i
<
CHILDREN
;
i
+=
1
)
{
quadtree_
tree_des
tr
o
y
(
&
a
->
child
[
i
]);
quadtree_
vertical_syme
try
(
tree
->
child
[
i
]);
}
quadtree_swap
((
void
**
)
&
tree
->
child
[
0
],
(
void
**
)
&
tree
->
child
[
2
]);
quadtree_swap
((
void
**
)
&
tree
->
child
[
1
],
(
void
**
)
&
tree
->
child
[
3
]);
}
}
void
quadtree_tree_destroy_clean
(
node
**
tree
)
void
quadtree_central_symetry
(
node
*
tree
)
{
quadtree_vertical_symetry
(
tree
);
quadtree_horizontal_symetry
(
tree
);
}
void
quadtree_tree_destroy
(
node
**
tree
)
{
if
(
NULL
!=
*
tree
)
{
...
...
@@ -191,7 +196,7 @@ void quadtree_tree_destroy_clean(node **tree)
{
for
(
uint32_t
i
=
0
;
i
<
CHILDREN
;
i
+=
1
)
{
quadtree_tree_destroy
_clean
(
&
(
*
tree
)
->
child
[
i
]);
quadtree_tree_destroy
(
&
(
*
tree
)
->
child
[
i
]);
}
}
else
...
...
This diff is collapsed.
Click to expand it.
quadtree.h
+
9
−
1
View file @
8276289a
...
...
@@ -42,3 +42,11 @@ void quadtree_tree_destroy(node **tree);
void
quadtree_tree2matrix
(
node
*
tree
,
matrix
*
mat
);
void
quadtree_tree_destroy_clean
(
node
**
tree
);
double
quadtree_position_value
(
int32_t
li
,
int32_t
col
,
node
*
a
,
int32_t
d
);
void
quadtree_horizontal_symetry
(
node
*
tree
);
void
quadtree_vertical_symetry
(
node
*
tree
);
void
quadtree_central_symetry
(
node
*
tree
);
\ No newline at end of file
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