Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
What's new
10
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Open sidebar
OpenFlipper-Free
Plugin-Topology
Commits
b833b679
Commit
b833b679
authored
Nov 16, 2015
by
Jan Möbius
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fixed Closest entities bug in topotlogy plugin (Thanks to Vincent de Marignac for the patch)
parent
3f570cdd
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
42 additions
and
29 deletions
+42
-29
TopologyPlugin.cc
TopologyPlugin.cc
+42
-29
No files found.
TopologyPlugin.cc
View file @
b833b679
...
...
@@ -41,9 +41,9 @@
/*===========================================================================*\
* *
* $Revision$ *
* $LastChangedBy$ *
* $Date$ *
* $Revision
: 21016
$ *
* $LastChangedBy
: schultz
$ *
* $Date
: 2015-07-16 16:48:42 +0200 (Thu, 16 Jul 2015)
$ *
* *
\*===========================================================================*/
...
...
@@ -276,13 +276,13 @@ void TopologyPlugin::add_face(QMouseEvent* _event) {
++
fv_it
;
if
(
(
m
.
point
(
*
fv_it
)
-
hit_point
).
sqrnorm
()
<
shortest_distance
)
{
//
shortest_distance = (m.point(fv_it
.handle()
) - hit_point).sqrnorm();
shortest_distance
=
(
m
.
point
(
*
fv_it
)
-
hit_point
).
sqrnorm
();
closest
=
*
fv_it
;
}
++
fv_it
;
if
(
(
m
.
point
(
*
fv_it
)
-
hit_point
).
sqrnorm
()
<
shortest_distance
)
{
//
shortest_distance = (m.point(fv_it
.handle()
) - hit_point).sqrnorm();
shortest_distance
=
(
m
.
point
(
*
fv_it
)
-
hit_point
).
sqrnorm
();
closest
=
*
fv_it
;
}
...
...
@@ -624,16 +624,18 @@ void TopologyPlugin::flip_edge(QMouseEvent* _event) {
++
fe_it
;
TriMesh
::
HalfedgeHandle
e3
=
m
.
halfedge_handle
(
*
fe_it
,
0
);
const
double
min_dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e1
)),
m
.
point
(
m
.
from_vertex_handle
(
e1
)));
double
min_dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e1
)),
m
.
point
(
m
.
from_vertex_handle
(
e1
)));
TriMesh
::
EdgeHandle
closest_edge
=
m
.
edge_handle
(
e1
);
if
(
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e2
)),
m
.
point
(
m
.
from_vertex_handle
(
e2
)))
<
min_dist
)
{
// min_dist = ACG::Geometry::distPointLineSquared(hit_point,m.point(m.to_vertex_handle( e2 )),m.point(m.from_vertex_handle( e2 )));
double
dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e2
)),
m
.
point
(
m
.
from_vertex_handle
(
e2
)));
if
(
dist
<
min_dist
)
{
min_dist
=
dist
;
closest_edge
=
m
.
edge_handle
(
e2
);
}
if
(
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e3
)),
m
.
point
(
m
.
from_vertex_handle
(
e3
)))
<
min_dist
)
{
// min_dist = ACG::Geometry::distPointLineSquared(hit_point,m.point(m.to_vertex_handle( e3 )),m.point(m.from_vertex_handle( e3 )));
dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e3
)),
m
.
point
(
m
.
from_vertex_handle
(
e3
)));
if
(
dist
<
min_dist
)
{
min_dist
=
dist
;
closest_edge
=
m
.
edge_handle
(
e3
);
}
...
...
@@ -687,34 +689,36 @@ void TopologyPlugin::collapse_edge(QMouseEvent* _event) {
++
fe_it
;
TriMesh
::
HalfedgeHandle
e3
=
m
.
halfedge_handle
(
*
fe_it
,
0
);
const
double
min_dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e1
)),
m
.
point
(
m
.
from_vertex_handle
(
e1
)));
TriMesh
::
HalfedgeHandle
closest_edge
=
e1
;
double
min_dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e1
)),
m
.
point
(
m
.
from_vertex_handle
(
e1
)));
TriMesh
::
HalfedgeHandle
closest_
half
edge
=
e1
;
if
(
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e2
)),
m
.
point
(
m
.
from_vertex_handle
(
e2
)))
<
min_dist
)
{
// min_dist = ACG::Geometry::distPointLineSquared(hit_point,m.point(m.to_vertex_handle( e2 )),m.point(m.from_vertex_handle( e2 )));
closest_edge
=
e2
;
double
dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e2
)),
m
.
point
(
m
.
from_vertex_handle
(
e2
)));
if
(
dist
<
min_dist
)
{
min_dist
=
dist
;
closest_halfedge
=
e2
;
}
if
(
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e3
)),
m
.
point
(
m
.
from_vertex_handle
(
e3
)))
<
min_dist
)
{
// min_dist = ACG::Geometry::distPointLineSquared(hit_point,m.point(m.to_vertex_handle( e3 )),m.point(m.from_vertex_handle( e3 )));
closest_edge
=
e3
;
dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e3
)),
m
.
point
(
m
.
from_vertex_handle
(
e3
)));
if
(
dist
<
min_dist
)
{
min_dist
=
dist
;
closest_halfedge
=
e3
;
}
// collapse into to point which is closer to hitpoint
TriMesh
::
Point
to
=
m
.
point
(
m
.
to_vertex_handle
(
closest_edge
)
);
TriMesh
::
Point
from
=
m
.
point
(
m
.
from_vertex_handle
(
closest_edge
)
);
TriMesh
::
Point
to
=
m
.
point
(
m
.
to_vertex_handle
(
closest_
half
edge
)
);
TriMesh
::
Point
from
=
m
.
point
(
m
.
from_vertex_handle
(
closest_
half
edge
)
);
if
(
(
hit_point
-
to
).
sqrnorm
()
>
(
hit_point
-
from
).
sqrnorm
()
)
closest_edge
=
m
.
opposite_halfedge_handle
(
closest_edge
);
closest_
half
edge
=
m
.
opposite_halfedge_handle
(
closest_
half
edge
);
if
(
m
.
is_collapse_ok
(
closest_edge
)
){
if
(
m
.
is_collapse_ok
(
closest_
half
edge
)
){
// m.point(m.to_vertex_handle(closest_edge)) = hit_point;
m
.
collapse
(
closest_edge
);
m
.
collapse
(
closest_
half
edge
);
m
.
garbage_collection
();
}
else
emit
log
(
LOGERR
,
"Collapse is not allowed here!"
);
emit
log
(
LOGOUT
,
"Picked Edge "
+
QString
::
number
(
closest_edge
.
idx
()));
emit
log
(
LOGOUT
,
"Picked Edge "
+
QString
::
number
(
closest_
half
edge
.
idx
()));
emit
updatedObject
(
object
->
id
(),
UPDATE_TOPOLOGY
);
emit
updateView
();
...
...
@@ -798,16 +802,25 @@ void TopologyPlugin::split_edge(QMouseEvent* _event) {
++
fe_it
;
TriMesh
::
HalfedgeHandle
e3
=
m
.
halfedge_handle
(
*
fe_it
,
0
);
const
double
min_dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e1
)),
m
.
point
(
m
.
from_vertex_handle
(
e1
)));
double
min_dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e1
)),
m
.
point
(
m
.
from_vertex_handle
(
e1
)));
TriMesh
::
EdgeHandle
closest_edge
=
m
.
edge_handle
(
e1
);
if
(
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e2
)),
m
.
point
(
m
.
from_vertex_handle
(
e2
)))
<
min_dist
)
{
// min_dist = ACG::Geometry::distPointLineSquared(hit_point,m.point(m.to_vertex_handle( e2 )),m.point(m.from_vertex_handle( e2 )));
double
dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e2
)),
m
.
point
(
m
.
from_vertex_handle
(
e2
)));
if
(
dist
<
min_dist
)
{
min_dist
=
dist
;
closest_edge
=
m
.
edge_handle
(
e2
);
}
dist
=
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e3
)),
m
.
point
(
m
.
from_vertex_handle
(
e3
)));
if
(
ACG
::
Geometry
::
distPointLineSquared
(
hit_point
,
m
.
point
(
m
.
to_vertex_handle
(
e3
)),
m
.
point
(
m
.
from_vertex_handle
(
e3
)))
<
min_dist
)
{
//
min_dist =
ACG::Geometry::distPointLineSquared(hit_point,m.point(m.to_vertex_handle( e3 )),m.point(m.from_vertex_handle( e3 )))
;
if
(
dist
<
min_dist
)
{
min_dist
=
dist
;
closest_edge
=
m
.
edge_handle
(
e3
);
}
...
...
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