Skip to main content
4 votes
3 answers
286 views

Matrices can be triangulated using less than ten lines of code in C, I have heard being said. But LU decomposition method needs to be used, instead of Cramer's rule. So, I was trying to do that. My ...
uran42's user avatar
  • 775
Advice
1 vote
2 replies
45 views

Is it even guaranteed that such a triangulation even exists for all expected list of normals? (It's easy to think of edge cases where it doesn't, in my case the normals will be composed of a long list ...
Jann Poppinga's user avatar
-5 votes
1 answer
115 views

I'm using the Google Maps Geolocation API to determine device location based on cellular data. The API allows submitting an array of cellTowers[] objects, each including fields like cellId, ...
pdroid's user avatar
  • 1
2 votes
0 answers
31 views

Let us assume that I have a collection of d-dimensional simplices in d dimension, each simplex being defined by its set of vertices (whose coordinates I have access to). d is strictly greater than 3. ...
Charles Arnal's user avatar
0 votes
0 answers
180 views

I am trying to process shapely polygon geometries and decompose them into triangles with the constraint that triangle vertices can only exist on the polygon edge(s). For some strange reason the code ...
Judith Levy's user avatar
1 vote
1 answer
156 views

I have a stereo camera system composed of two cameras placed perpendicular to each other but pointing at a common center. I have successfully camera calibrated each camera, and have also stereo ...
Adeu's user avatar
  • 13
1 vote
3 answers
164 views

Goal: I have a list of lots of triangles on a 2D surface, represented as std::vector<QPolygonF>. I want to transform this list into another list of triangles that have the same outline, but no ...
Aykhan Hagverdili's user avatar
1 vote
0 answers
208 views

I'm trying to setup a 3D scanner using a single camera and a projector based on gray code structured light. The resulting pointclouds are heavily warped. ( see image below) Warped point cloud target ...
Jones1403's user avatar
0 votes
1 answer
60 views

I've got a 3D surface built on Delaunay triangulation. Do you know how to enforce matplotlib to paint each triangle not with a constant color but with a user-defined-function dependent color ? (or at ...
user24353751's user avatar
0 votes
1 answer
128 views

I have been researching methods to compute the Laplacian/Laplace-Beltrami operator, but I've found that R lacks built functions for these purposes. There is actually a package that allows for ...
fina's user avatar
  • 451
1 vote
2 answers
1k views

I have 68 3d points (I'm guessing it's called a sparse point cloud). I want to connect them all together to create a mesh. I first tried this using Delaunay Triangulation. However, it didn't work well ...
Sammy Medawar's user avatar
0 votes
1 answer
257 views

In the following, does "mesh_size" refer to the maximum perimeter or maximum area of each element? with pygmsh.geo.Geometry() as geom: geom.add_polygon( [ [0.0, 0.0], ...
HIH's user avatar
  • 101
1 vote
0 answers
130 views

I have two cameras in a fixed position on the vehicle and the features of these cameras are exactly the same. First, I record an image with these two cameras, which I call "initial". Then, ...
Tolga's user avatar
  • 11
0 votes
1 answer
350 views

My original polygon WKT is this: POLYGON ((98.51786360976723 78.60265688535823, 98.51786360976723 78.67546052678281, 98.78608990953424 78.67546052678281, 98.78608990953424 78.60265688535823, 98....
Sunil Chormale's user avatar
0 votes
1 answer
454 views

how do I find a the xyz position on a surface created with multiple points. Say I survey the perimeter of a parking lot sloped in 2 directions not necessarily on a flat plan to create a surface. If i ...
john's user avatar
  • 1

15 30 50 per page
1
2 3 4 5
56