Alternatively one could also try to find the base points of the connection,
by iterating along straight g and calculating the distance of this to straight h.
This should result in a set of data points, with corresponding distances, which have to be minimized to minimum distance.
Or you take the distance formula of ([[VertexFindingDistancePointStraight][Distance Point to Straight]) and fit the this function to the data points.
The result should be the base point of the perpendicular on g.
Analog you can find the base point on straigh h.
The middle of the connection between g and h is than the Vertex.
...Back to Vertex Finding
-- PeterZumbruch - 24 Feb 2004

I | Attachment | Action | Size | Date | Who | Comment |
---|---|---|---|---|---|---|

draw | tracksituation.draw | manage | 3.4 K | 2004-02-24 - 14:03 | PeterZumbruch | TWikiDraw draw file |

gif | tracksituation.gif | manage | 3.0 K | 2004-02-24 - 14:04 | PeterZumbruch | TWikiDraw GIF file |

This topic: Personalpages > WebHome > HomepagePeterZumbruch > VertexFindingIterativelyPeterZumbruch

Topic revision: revision 2

Topic revision: revision 2

Copyright © by the contributing authors. All material on this collaboration platform is the property of the contributing authors.

Ideas, requests, problems regarding GSI Wiki?**Send feedback**

**Imprint (in German)**

**Privacy Policy (in German)**

Ideas, requests, problems regarding GSI Wiki?