Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
I
imagej-elphel
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
3
Issues
3
List
Board
Labels
Milestones
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Commits
Issue Boards
Open sidebar
Elphel
imagej-elphel
Commits
5ae6b730
Commit
5ae6b730
authored
Nov 22, 2022
by
Andrey Filippov
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Refactored texture processing steps
parent
0b00f0ae
Changes
3
Expand all
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
667 additions
and
265 deletions
+667
-265
TexturedModel.java
...n/java/com/elphel/imagej/tileprocessor/TexturedModel.java
+645
-262
TileNeibs.java
src/main/java/com/elphel/imagej/tileprocessor/TileNeibs.java
+20
-1
TilePlanes.java
...main/java/com/elphel/imagej/tileprocessor/TilePlanes.java
+2
-2
No files found.
src/main/java/com/elphel/imagej/tileprocessor/TexturedModel.java
View file @
5ae6b730
This diff is collapsed.
Click to expand it.
src/main/java/com/elphel/imagej/tileprocessor/TileNeibs.java
View file @
5ae6b730
...
@@ -391,6 +391,25 @@ public class TileNeibs{
...
@@ -391,6 +391,25 @@ public class TileNeibs{
for
(
int
i
=
0
;
i
<
tiles
.
length
;
i
++)
tiles
[
i
]
=
!
itiles
[
i
];
for
(
int
i
=
0
;
i
<
tiles
.
length
;
i
++)
tiles
[
i
]
=
!
itiles
[
i
];
}
}
public
boolean
[]
getEdgeSelection
(
int
shrink
,
// grow tile selection by 1 over non-background tiles 1: 4 directions, 2 - 8 directions, 3 - 8 by 1, 4 by 1 more
boolean
[]
tiles
,
boolean
[]
prohibit
)
{
boolean
[]
etiles
=
new
boolean
[
tiles
.
length
];
for
(
int
i
=
0
;
i
<
tiles
.
length
;
i
++)
etiles
[
i
]
=
!
tiles
[
i
];
growSelection
(
shrink
,
// grow tile selection by 1 over non-background tiles 1: 4 directions, 2 - 8 directions, 3 - 8 by 1, 4 by 1 more
etiles
,
prohibit
);
for
(
int
i
=
0
;
i
<
tiles
.
length
;
i
++)
etiles
[
i
]
&=
tiles
[
i
];
return
etiles
;
}
public
void
growSelection
(
public
void
growSelection
(
int
grow
,
// grow tile selection by 1 over non-background tiles 1: 4 directions, 2 - 8 directions, 3 - 8 by 1, 4 by 1 more
int
grow
,
// grow tile selection by 1 over non-background tiles 1: 4 directions, 2 - 8 directions, 3 - 8 by 1, 4 by 1 more
boolean
[]
tiles
,
boolean
[]
tiles
,
...
@@ -630,7 +649,7 @@ public class TileNeibs{
...
@@ -630,7 +649,7 @@ public class TileNeibs{
}
}
return
enum_clust_ordered
;
return
enum_clust_ordered
;
}
}
public
int
getMax
(
public
static
int
getMax
(
int
[]
data
)
int
[]
data
)
{
{
int
mx
=
data
[
0
];
int
mx
=
data
[
0
];
...
...
src/main/java/com/elphel/imagej/tileprocessor/TilePlanes.java
View file @
5ae6b730
...
@@ -5662,7 +5662,7 @@ public class TilePlanes {
...
@@ -5662,7 +5662,7 @@ public class TilePlanes {
grown_sel
,
// boolean [] tiles,
grown_sel
,
// boolean [] tiles,
false
);
// boolean ordered)
false
);
// boolean ordered)
int
num_clusters
=
t
ileNeibs
.
getMax
(
int
num_clusters
=
T
ileNeibs
.
getMax
(
clusters
);
// int [] data)
clusters
);
// int [] data)
if
(
num_clusters
>
1
){
if
(
num_clusters
>
1
){
boolean
[]
dbg_grown_sel
=
grown_sel
.
clone
();
boolean
[]
dbg_grown_sel
=
grown_sel
.
clone
();
...
@@ -5699,7 +5699,7 @@ public class TilePlanes {
...
@@ -5699,7 +5699,7 @@ public class TilePlanes {
clusters
=
tileNeibs
.
enumerateClusters
(
clusters
=
tileNeibs
.
enumerateClusters
(
grown_sel
,
// boolean [] tiles,
grown_sel
,
// boolean [] tiles,
false
);
// boolean ordered)
false
);
// boolean ordered)
num_clusters
=
t
ileNeibs
.
getMax
(
num_clusters
=
T
ileNeibs
.
getMax
(
clusters
);
clusters
);
if
(
num_clusters
>
1
){
if
(
num_clusters
>
1
){
boolean
[][]
cluster_sels
=
new
boolean
[
num_clusters
][
selections
[
np
].
length
];
boolean
[][]
cluster_sels
=
new
boolean
[
num_clusters
][
selections
[
np
].
length
];
...
...
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