Rank: 1336 based on 112 downloads (last 30 days) and 3 files submitted
photo

Johannes Korsawe

E-mail

Personal Profile:

I am a mathematician at the Volkswagen AG and working with MATLAB since ~1998.

Professional Interests:
fem, geometrical computations

 

Watch this Author's files

 

Files Posted by Johannes View all
Updated   File Tags Downloads
(last 30 days)
Comments Rating
06 Jan 2014 Screenshot intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe inside, 3d, point, mesh, volume, watertight 27 9
27 Jan 2012 Screenshot circlefit3d - fit circle to three points in 3d space Calculate center, radius and plane of circle that passes through three given points Author: Johannes Korsawe circle, points, fit, interpolation, 3d, linear algebra 43 2
  • 5.0
5.0 | 2 ratings
09 Jan 2008 Screenshot Minimal Bounding Box Minimal bounding box around points in the (x,y,z) space Author: Johannes Korsawe bounding, box, cuboid, minimum, surface 42 3
  • 4.83333
4.8 | 6 ratings
Comments and Ratings by Johannes View all
Updated File Comments Rating
07 Mar 2014 grep: a pedestrian, very fast grep utility a unix-like, very fast grep utility to find strings(s) in files of any type Author: us

This should be included in regular MATLAB releases.
It is the rescue boat if you are forced to work with Windows.

06 Jan 2014 intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe

Hi yusuf,
you are right, you can easily extend the program or make a check prior to intriangulation to give results for this case as a quick help.
I will fix this as soon as i come to time.

31 Oct 2013 intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe

Acceleration is done but without domain decomposition methods as of Sven's submission, which i currently have no time to do.

The main advantage of intriangulation is the fact i do not need any orientation of the triangles which can be a significant (one-time) effort to do at least with my realworld examples.

25 Sep 2013 intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe

Sven,
your numbers are right. I did not have the latest version of your submission.

So i still have to accelerate intriangulation.... :-)

24 Sep 2013 intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe

@Sven. I fail to recover your statement that for this very example inpolyhedron is faster. With my PC, it is exactly the other way round. Here are my results of your script:

For 1 test points: intri: 0.114747s. inpol: 0.124156s.
For 10 test points: intri: 0.013370s. inpol: 0.021715s.
For 100 test points: intri: 0.010008s. inpol: 0.028562s.
For 1000 test points: intri: 0.071619s. inpol: 0.127528s.
For 5000 test points: intri: 0.351135s. inpol: 0.912710s.
For 10000 test points: intri: 0.704125s. inpol: 2.767123s.
For 100000 test points: intri: 7.039906s. inpol: 209.625841s.

Could it be that there is some cuda acceleration which could result in such differences in speed judgement?

You are right, that intriangulation gives an uncorrect result for your second example. I will think about that. For the meantime i hope that for real meshes, this exact case will not occur.

Comments and Ratings on Johannes' Files View all
Updated File Comment by Comments Rating
21 Mar 2014 circlefit3d - fit circle to three points in 3d space Calculate center, radius and plane of circle that passes through three given points Author: Johannes Korsawe Fernando

Thanks!!! very helpful

18 Jan 2014 Minimal Bounding Box Minimal bounding box around points in the (x,y,z) space Author: Johannes Korsawe redha, fourar

17 Jan 2014 Minimal Bounding Box Minimal bounding box around points in the (x,y,z) space Author: Johannes Korsawe Matt Kindig

A simple fix to reduce the run-time is to replace the line:

rot_i = Rmat(-edgeangles(i));

with these lines:
theta = -edgeangles(i);
rot_i = [cos(theta), sin(theta); -sin(theta) cos(theta)];

In my testing, this reduces the run-time by a factor of ~2.

06 Jan 2014 intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe Korsawe, Johannes

Hi yusuf,
you are right, you can easily extend the program or make a check prior to intriangulation to give results for this case as a quick help.
I will fix this as soon as i come to time.

30 Dec 2013 intriangulation - which points are inside a 3d watertight triangulation? Are 3D-testpoints located inside or outside an arbitrary watertight mesh with vertices and faces? Author: Johannes Korsawe yusuf

Hi,

I faced with some problem about program. When the point coincides the vertex point of the geometry the program can not determine whether the point is inside or outside. Moreover when I change the number of the points (increased) for the same geometry the program gives same error.

Contact us