Matlab: 3D Coordinate System Rotations with Vectors

-

This post describes how to switch/transform between corrdinate systems in Matlab and how this can be represented. There are 3 functions that are crucial here:

  • grid3D(startVec, stopVec, varargin) ... Creates an orthogonal grid in 3D depending on start and end point (diagonal of a cube) and draws ticks, labels and MinorGrids.
    Rotations can be performed here to show how to transform between Cartesian corrdinate systems.
  • point3D(startVec, stopVec, varargin) ... Is a function to create 3D vectors based on start and end points. It includes options like naming the points, displaying them as arrows, as well as settings for color and thickness.
  • arrow3D(startVec, stopVec, varargin) ... This function creates an arrow in 3D that can be scaled by the options.

The functions including example can be downloaded here:
Matlab-Functions/CartesianCorrdinateTransformation at main · PhysIngo/Matlab-Functions (github.com)

First of all an example where the 1 coordinate system with 2 vectors is rotated 2 times in space:

Kommentare

Kommentar veröffentlichen

Beliebte Posts aus diesem Blog

Easy Plots in HTML/PHP with Google Charts

-
Bild
With this function Plots.php it is very easy to make plots in php. You only need to define an array and the parameters you want to show.  PHP/Plots.php at main · PhysIngo/PHP (github.com) Online Code We first generate very easy artificial data like this. We fill a array with time vals and random values and numbers to display different stuff. $newArr = array(); for ($i=0;$i<20;$i++){   $val = 1554241121+60*60*60*$i*$i;   $newArr[$i]["Time"] = gmdate("Y-m-d h:i:s",$val);   $newArr[$i]["Rand"] = 8*sqrt(abs(100*(sin($val))));   $newArr[$i]["Rand2"] = 100*cos(4*$val)*cos($val);      $newArr[$i]["Mean"] = ($newArr[$i]["Rand"]+$newArr[$i]["Rand2"])/2;   $newArr[$i]["Months"] = gmdate("F",$val);   $newArr[$i]["Days"] = gmdate("j",$val);   $newArr[$i]["Days2"] = gmdate("n",$val); } General Settings // general string $paramsname = array("Time","Rand&
Mehr anzeigen

Matlab: Dijkstra methode - shortest way on gradient (small neighborhood)

-
Bild
The Dijkstra Methode ( German ) In this post i show you with Matlab how to calculate the shortest path on a gradient images with d´the dijkstra methode i wrote. I take an image as an input and convert it to an double and calculate the gradient [G,Gdir] = imgradient(img,'sobel'); and I use my function Dijkstra(G,p,q) : THis function needs a image as double G , a start value p and the target q , where the first entry of the oints is the column and the second the row. This methode sets all distances to infinity except the at the start value is zero obviously. All unvisited pixels have the value 1. The algortihm continous as long as the target is an unvisible pixel. For all neighborhood pixels the weights are calculated with the function [weight] = localedgewidth(G,p,q) ,where the value of the neightbor pixel is substract by the maximum of the matrix and devided by the difference of maximal and minimal value of the matrix G and multiplied with the distance to the neighbor pi
Mehr anzeigen