For questons about triangulation, that is a) the subdivision of the plane or other topological spaces into triangles (or, more generally, simplices) or b) the methods used in surveying for locating points by measuring angles and accessible lengths of triangles
2
votes
2answers
47 views
What is a good way to simplicize the integer lattice?
I have a function $f$ defined on the positive integer lattice in $\mathbb{R}^n$ (i.e. the vectors in $\mathbb{R}^n$ whose coordinates are all nonnegative integers). I want to extend the domain of $f$ ...
3
votes
1answer
43 views
Linear, Bi-linear or better
I have been writing some code to do some interpolation of 2D data on an irregular grid. So far what I have done is:
Triangulate the known points using Delaunay.
Find the vertices of the triangles ...
0
votes
0answers
29 views
How to derive an average Z value among arbitrarily distributed X, Y, Z points
I am triangulating using Delauney algorithm to create a 2D (x, y) flat surface in OpenGL. There are "control points" available, with (x,y,z) values that I need to apply to the triangulated surface to ...
1
vote
1answer
107 views
Geometry - optimal 2D mesh between X expendable points
Say you have X points on a plane.
If you connect two points, you form a line. Connecting three points forms a triangle.
A line cannot cross a line, and a smaller triangle cannot be created inside a ...
0
votes
0answers
34 views
How to draw a regular tessellation of a sphere on a plane?
I have really been stuck with this for a while. Any help will be much appreciated --
Is there a nice way to draw a tessellation of a sphere, say where three 4-polygons meet at every vertex, on a ...
0
votes
0answers
35 views
Can the distance between $3$ points be worked out given their magnetic bearings?
I have 3 moving points which I want to find the distance between.
Each point transmits radio waves which the others receive. At each point the field strength of the transmitted wave from the other ...
0
votes
1answer
50 views
Formula to calculate a position given three 2D locations and distance
I am doing a project for my final year computer science and normally post on stack-overflow but this question seems more suited for here. I need a formula to calculate my position from three 2D points ...
0
votes
1answer
43 views
Calculate Angular Position from a gyro
I am working with a gyro that outputs Angular Velocity. I am wondering how I would calculate Angular Position from this data. I have read a couple different places that you need the (sample rate, ...
2
votes
1answer
48 views
Algorithm Design for Delaunay Triangulation?
I am very much happy after seeing some very good answers in this site. I am trying to design a algorithm for the construction of
Delaunay Triangulation
using Randomized Incremental Algorithm.(I wont ...
0
votes
0answers
35 views
Corresponding Triangulations of an (n+2)-gon to n Segments Connecting n+1 Collinear Points
So I'm asked to count the number of ways of connecting n+1 collinear points with n line segments subjected to the following constraints:
If the line is L
1) No segment passes below L.
2) Starting at ...
2
votes
0answers
33 views
problem in dimensionality reduction
I am using multidimensional scaling to plot my data in R. However there is a hierarchy in my dataset which i want to exploit and I am using the delaunay triangulation to visualize the plot. So now I ...
3
votes
1answer
107 views
GSM triangulation
Could you describe an algorithm of triangulation based on the GSM data.
If you know the coordinates of three towers in latitude/longitude, the signal strengh of each tower, how to find the ...
8
votes
2answers
101 views
Why does the term ${\frac{1}{n-1}} {2n-4\choose n-2}$ counts the number of possible triangulations in a polygon?
In the given picture bellow, it counts the number of different triangloations in a polygon, how do the get to this expression, why is it:
$$
{2n-4\choose n-2}
$$
and why do we multiply it by ...
0
votes
1answer
33 views
Let $\Gamma$ be discrete in S. Then for any region $Ω$ in $S$, $Ω \cap \Gamma$ is discrete in Ω
I'm trying to understand this existence of triangulation's proof in this book.
I have problems to understand the lemma 8.2.6:
Let $\Gamma$ be discrete in S. Then for any region $Ω$ in $S$, $Ω \cap ...
1
vote
0answers
52 views
Generate coordinates for abstract triangulation
I have an abstract triangulation, which consists of nodes without coordinates and connectivity information (the triangles themselves). I also know that each link has a fixed length. For simplicity we ...
