Geometry is a branch of mathematics. Geometry studies the spatial relationships and forms of objects, as well as other relationships and forms, similar to the spatial in its structure.

learn more… | top users | synonyms

0
votes
0answers
30 views

How to optimize interaction of flexible 3D shapes in space/what is this technique called

I am not sure what terminology I should use here or even what field this is. That information itself would be incredibly helpful, this is new territory for me. I'm trying to figure out how to solve ...
0
votes
0answers
28 views

How is a satellite's orbit calculated using only ground to satellite range measurements?

This task is often done in a process known as Satellite Laser Ranging (SLR). SLR stations (of known coordinates) track satellites, recording range measurements to the satellite at known times. I would ...
2
votes
0answers
35 views

How can I find a line segment with the most intersections along with the coordinates of the intersection points?

There are n number of points in a 2D plane and each have x and y co-ordinates.They are stored in an array in ascending order with respect to x. All points are connected together by a line segment ($n\...
6
votes
0answers
108 views

Does some form of documentation of GMSH exist?

I am looking to implement GMSh into a simualtor that I am going to create. I am looking to integrate the geo, mesh, and post processor modules. However, looking online, it appears the documentation ...
3
votes
5answers
201 views

Fast comparison of line segments lengths

I have two line segments given by their endpoints $(a_1,a_2)$, $(b_1,b_2)$ in $R^3$ and want to know if they have the same length (up to some error), so that the naive test looks like $$|\, \Vert a_1-...
2
votes
3answers
88 views

Angle of rotation at a point in a deformed triangle

I have a 2D triangle which deforms with each vertex moving by some small ($\sin(x) \approx \tan(x) \approx x$) displacement vector. The displacement of any point in the triangle is linearly ...
2
votes
2answers
167 views

Fitting orthogonal planes to a point set

I have a set of 3d points to which I want to fit two planes. I know the assignment of points to the planes so I don't need any RANSAC or similar. Currently, I'm using a PCA-based approach to fit two ...
1
vote
0answers
27 views

Detecting and joining series of line segments that run along each other

Given: Several circular series of map GPS coordinates for several bus routes. The GPS coordinates are not all equal when they run along the same road. The number of GPS coordinates for a single bus ...
2
votes
0answers
86 views

intersection between polygon. Algorithm to check it

I'm working on an algorithm which should check if two polygons, described by their vertex coordinates, are: one inside the other, are intersecting or are separated image below describe this three ...
3
votes
5answers
161 views

Distance between points

I am wondering how can I solve following problem. Arrange randomly $n$ points inside a square of side $a$ under the condition that the distance between any two points may not be smaller than 1. I ...
1
vote
2answers
256 views

Ideas on how to search nearby geospatial data fast

I am looking at a very simple problem, but can't quite find the best solution. I need to accept a lat/lon coordinate and based on that coordinate find all the points within roughly ~1km (accuracy is ...
3
votes
0answers
74 views

How to sample points in hyperbolic space?

Hyperbolic space in the Poincaré upper half space model looks like ordinary $\Bbb R^n$ but with the notion of angle and distance distorted in a relatively simple way. In Euclidean space I can sample a ...
3
votes
0answers
77 views

Shape measure for C-shaped objects

There are many well defined measures for many basic geometrical objects such as rectangularity (area coverage of minimum bounding rectangle), triangularity (area coverage of minimum enclosing triangle)...
1
vote
1answer
60 views

Layer on which ball belongs in tetrahedron

What is the most computationally efficient way to find the layer on which a ball (i) belongs when arranged in a tetrahedron or 3 dimensional triangle with a triangular base. The ball on the top layer ...
0
votes
2answers
86 views

Minimizing the edge length of a polygon preserving its angles

I am trying to minimize the edge lengths of a polygon while keeping the angles the same. I can achieve this geometrically (iteratively), however, I am looking for some related papers that can solve ...
0
votes
1answer
169 views

Convex Polygon Intersection

Determining the intersection of two convex polygons is one of the fundamental problems in computational geometry . I'm asking for an algorithm having: INPUT: Given two convex polygons P and Q in 2D (...
0
votes
0answers
66 views

Principal Components Analysis Not Behaving as I Expect it to

I have a bunch of points in $\mathbb{R}^3$ that I would like to translate and rotate so that their center is at the origin and the variance along the $x$ and $y$ axes are maximal (greedy, and in that ...
2
votes
1answer
75 views

The closed form solution of a point on a plane

Given a plane in 3D Euclidean space is $\pi$: $ax+by+cz+d=0$ and a point $P$:$(X,Y,Z)\in \mathbb{R}^3$. Find a point $Q:(X^*,Y^*,Z^*)\in \pi$ such that: $$Q= \arg\min\limits_{Q^*\in\pi}\left\|P-Q\...
2
votes
1answer
46 views

Geographic distance between two regions

I am currently trying to calculate the geographic distance between two regions as I want to correlate it with their similarity of another aspect (e.g., similarity in word usage). Currently, I have ...
0
votes
0answers
61 views

Is it possible to generalize the two view Sampson error to multiple view cases in computer vision?

In multiple view geometry of computer vision, there is a geometric error called Sampson error which is very useful in the nonlinear estimation of fundamental matrix....
2
votes
1answer
123 views

Inclined plate capacitor grid/ mesh

You can calculate the electric potential over every point in a defined space by solving Laplace's equation. To do this in a computer program you set up an 2-d array/ matrix and loop the internal ...
1
vote
0answers
56 views

Environment for implementing/testing Computer Graphics algorithms [closed]

I need to code up a computer graphics algorithm for Surface Registration. Briefly surface registration is the process of finding "optimal" one-one correspondence between surfaces, where the meaning ...
4
votes
1answer
866 views

Minimal surface solution in Python

Note: this question was also posted in StackOverflow and math.stackexchange. I have a set of 3D points defining a 3D contour, as shown below. The points in this contour lie in their best-fit plane ...
1
vote
0answers
383 views

Pixel-To-Angle Transformation in Camera Image

I'm trying to localize points I see in a camera image in terms of azimuth and elevation and match points between shots. Individual shots should differ only in rotation around the camera's center (...
5
votes
3answers
268 views

Monte Carlo approximation of PI

I'm trying to understand how to compute the value of Pi by means of the Monte Carlo simulation. I have a circle inside a square where the sides of the square are tangent to the circle. As data I have ...
2
votes
2answers
98 views

A sufficient number of distances to recover relative positions of n points

On several places I found different claims on a sufficient number of distances to recover relative positions of $n$ points in $d$-dimensional space. For instance, work from http://www.dimitris-...
3
votes
1answer
547 views

Application of an orthogonal matrix to a 3D configuration of point

Suppose a 3D configuration of points is given, $X\in\mathbb{R}^{n\times 3}$, and a matrix $Q\in\mathbb{3\times 2}$, with orthonormal columns. Now, suppose a mapping to 2D is obtained as $$Y=XQ.$$ ...
2
votes
2answers
227 views

Algorithm to compute the intersection of meshlines with a boundary

I need a program or an algorithm that computes the intersection of a mesh and a boundary. The mesh is structured orthogonal in nature and the boundary is a circle (for example). This will be used ...
4
votes
3answers
244 views

How to fill a 2D set over a cartesian lattice with as few rectangles as possible?

Suppose I have a black and white image (composed of binary pixel values in a 2D cartesian array) that contains an irregular, nonconvex shape. Let's further suppose that the shape is one connected ...
6
votes
3answers
520 views

Surface Mesh Library

I'm thinking a bit about the Front Tracking method used for simulation of Two phase flow with sharp interfaces. The literature tells me that the main issue is the surface mesh representation (...
2
votes
1answer
321 views

Testing a simple polygon for monotonicity in linear time question

I'm looking for the algorithm of Preparata and Supowit for testing a simple polygon for monotonicity in linear time. I've found it referenced in many textbooks but I can't find the algorithm itself. ...
3
votes
2answers
903 views

Looking for a library or algorithms to perfom clipping 3D unstructured meshes by a set of surfaces

We have a 3D (volume) unstructured, possibly hybrid, degenerative irregular mesh data structure that we are capable of generating (mostly composed of hexahedra and general polyhedra, using a mix of ...