Triangulation is either using angular measurements along a baseline to find the location of points, or splitting a polygon into triangles so that it can be rendered by a graphics library.
Questions tagged [triangulation]
831 questions
0
votes
1 answer
Does the Delaunay triangulation contain all triangles with empty circumcircle?
I have a set of points and I want to find all triangles that have an empty circumcircle. I think that that the Delaunay triangulation does so.
I have read some papers on the subject but I am not sure whether the Delaunay triangulation finds all such…
0
votes
1 answer
location tracking through mobile network in android
recently I checked location in galaxy tab by disabling GPS and wifi and the accuracy is around 50 to 65 meters(location is rural).
later I cleared the total cache memory of the maps app, and the device and when I checked the location under same…

user32693
- 1
- 1
- 1
0
votes
2 answers
Has anyone already used the Triangle/Triangle++ library in a C++ project ? (delaunay triangulation)
I'm using SFML and I want to make a delaunay triangulation of a random set of points.
http://www.cs.cmu.edu/~quake/triangle.html
I'm using triangle++, a c++ wrapper
http://www.compgeom.com/~piyush/scripts/triangle/
I added those #defines
#define…

jokoon
- 6,207
- 11
- 48
- 85
0
votes
1 answer
Shifting the triangles order to match colormap
This question is a sequel of a previous one but regarding this time the colormap and the order of the triangle. I want to interpolate experimental data over a surface so as to enable a continuous colormap with however the surface known only at its…

TazgerO
- 535
- 6
- 22
0
votes
1 answer
How to do a delaunay triangulation of a circle
does anyone knows how to create a delaunay triangulation of a circle in c++? I already have one solution but it's very efficient, I used the openCV delaunay.c as an example. I was wondering if someone had done something similar and could give-me a…

dd3
- 1
- 1
- 2
0
votes
1 answer
Determine what edge of polygon is lying immediately above processed vertex. Sort edges top to bottom
I'm doing plane sweep polygon triangulation. And for example, when I encounter split vertex, I should make it helper of edge of polygon that is lying immediately above this (split) vertex.
Also, I should have data structure (sweep line status) that…

fuzzomorphism
- 79
- 1
- 10
0
votes
2 answers
How to get one non-manifod mesh with adaptive point distribution
all
I try to obtain one triangle mesh from one point cloud. The mesh is expected to be manifold, the triangles are well shaped or equilateral and the distribution of the points are adaptive in terms of the curvature.
There are valuable…

Jogging Song
- 573
- 6
- 28
0
votes
1 answer
How to sort a series of lines sharing the same vertex in clockwise order
I am trying to store a triangulation in a Doubly Connected Edge List structure, and I am stuck on one step.
my question: How can I sort a list of half-edges that all share the same tail in a clockwise order?
To those who aren't familiar with this…

user2605344
- 15
- 2
0
votes
1 answer
How to get vertices of a triangle in constraint delaunay triangulation?
I have written a program using cgal as follows:
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Triangulation_vertex_base_2 Vb;
typedef…

Mehdi bayat
- 199
- 2
- 13
0
votes
2 answers
how can i do delaunay triangulation of simple polygon and find it's neighbors for any triangles in cgal
how can i do using CGAl, Delaunay triangulation of polygon (simple without hole and in cw order) and get a list of the neighbors of triangles for any triangle that generated from the Delaunay triangulation?

Mehdi bayat
- 199
- 2
- 13
0
votes
1 answer
Rasterizing Delaunay triangulation in Matlab
I have computed a Delaunay triangulation using DelaunayTri() in Matlab R2010b. Now I would like to burn a subset of the triangles (i.e. 12200 triangles) into a matrix (Raster). Is there any fast/efficient way of doing this?
I have tried using both…

jatobat
- 749
- 3
- 8
- 21
0
votes
1 answer
CGAL: remove faces from a constrained Delaunay triangulation
I have a constrained Delaunay Triangulation and i want to create w hole in a shape of a polygon. a hole in which there are no faces. How can i do that using CGAL ?
0
votes
1 answer
Triangulate a polygon in objective c
I need to triangulate a polygon that could be convex or concave, but it doesn't have holes
in it, is there a code or a library for objective-c that does the job?

Bassel Shawi
- 604
- 4
- 11
- 29
0
votes
1 answer
Locational triangulation
I have data about 10 points in a 2D map, I know the location of points 1,2 and 3. I also know the distance between point 1,2 and 3 to all other points.
I know that cell phone uses distance from gsm towers to locate their location. I wish to use…

Halox
- 103
- 1
- 10
0
votes
0 answers
Image-based reconstruction using triangulation
I'm currently trying to implement the triangulation algorithm proposed by Hartley and Sturm (here) and I'm having some difficulties. I think I understand the idea behind it, but I'm not sure how to parameterize the pencil of epipolar lines.
Given…

zync
- 463
- 3
- 17