triangulation

问题 I'm trying to construct a Delaunay triangulation for the very specific case where the input x and y coordinates are orthogonal and relatively equidistant. Given the data size is relatively large (1000x1200 triangulation points) and that the Qhull algorithm doesn't know about my extra orthogonal condition, the triangulation is relatively slow (25 seconds on my machine). As such, I'd like to manually construct a Delaunay triangulation with each of my known quads subdivided into two triangles. I

问题 I currently have a stereo camera setup. I have calibrated both cameras and have the intrinsic matrix for both cameras K1 and K2 . K1 = [2297.311, 0, 319.498; 0, 2297.313, 239.499; 0, 0, 1]; K2 = [2297.304, 0, 319.508; 0, 2297.301, 239.514; 0, 0, 1]; I have also determined the Fundamental matrix F between the two cameras using findFundamentalMat() from OpenCV. I have tested the Epipolar constraint using a pair of corresponding points x1 and x2 (in pixel coordinates) and it is very close to 0 .

问题 I have a triangulated mesh. Assume it looks like an bumpy surface. I want to be able to find all edges that fall on the surrounding border of the mesh. (forget about inner vertices) I know I have to find edges that are only connected to one triangle, and collect all these together and that is the answer. But I want to be sure that the vertices of these edges are ordered clockwise around the shape. I want to do this because I would like to get a polygon line around the outside of mesh. I hope

问题 I have a pointlist=[p1,p2,p3...] where p1 = [x1,y1],p2=[x2,y2] ... I want to use scipy.spatial.Delaunay to do trianglation on these point clouds and then plot it How can i do this ? The documentation for the Delaunay is really scarce so far i have this code from subprocess import Popen, PIPE import os os.environ['point_num'] = "2000" cmd = 'rbox $point_num D2 | tail -n $point_num' sub_process = Popen(cmd, shell=True,stdout=PIPE,stderr=PIPE) output = sub_process.communicate() points = [line

问题 What is the best way to triangulate a polygon with Boost? I use Boost.polygon. My current algorithm: Compute a voronoï diagram from my polygon vertices. Create one directed polygon-edge for each cell-edge (this will create two directed polygon edge per cell-edge) Iterate over all created edges to create triangles (not trivial) Any better solution? Edit: I just realized that it is probably possible to walk through the cells in a special way to create the triangles directly (3 neighbor cells

问题 Well I'm lacking GraphicsPath in Unity (to fills polygon, draw them with and outline and utilities with shapes in general), so I'm doing my own implementation of it. Well, we could debate also which is the best option, but actually, I prefer this because I'm learning a lot. The idea is the following, given a polygon, we do an offset polygon (inwards and outwards) with ClipperLib, and later with LibTessDotNet we triangulate it, outputing this: Green, blue and yellow pixels are the sides of

问题 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 corner node. To interpolate, I put a canonical example which works quite well but fails on real data. Indeed as shown in the example below, the initial triangulation results in two triangles with a huge gap between them, cf first picture. When the

问题 I am trying to triangulate points from a projector and a camera using Structured Light in OpenCV Python. In this process I have a list of tuples that match one to one between the camera and the projector. I am passing this to cv2.undistortedPoints() as below: camera_normalizedPoints = cv2.undistortPoints(camera_points, camera_K, camera_d) However, python is throwing the following error and I am unable to understand what the error means. camera_normalizedPoints = cv2.undistortPoints(camera

问题 I'm a newbie to CGAL library. However, I think it's a very suitable package for what I want to do. I have a set of points representing a 3D surface (as shown in figure 1). I want to fit a 3d triangulation on this surface. The surface is not closed and therefore does not occupy a volume. The code provided in poisson_reconstruction_example.cpp seems appropriate for this job. But the problem is that as a part of poisson_reconstruction algorithm it closes the ends and underneath of the surface to

问题 I have a set of points on an OPEN surface in 3D space. I have identified a subset of points which lay on the boundary. I mean to generate a triangulation of those points, which gives me an open surface and keeps my selected points on the boundary. All references I found deal with (sometimes?) closed surfaces, e.g., CGAL. See examples below. In addition, some CGAL algorithms require oriented normals at each point, which I do not have. Is there an available algorithm and code for this? (either