Tagged Questions
1
vote
1answer
27 views
Distance between point and plane & orthogonal projection matrix
I am poor in mathematics and want to learn few fundamental ethics to understand some of advanced things;
For plane $i$, denote $n_i\in\mathbb{R}^3$ and $o_i\in\mathbb{R}^3$ respectively as its normal ...
0
votes
0answers
8 views
common coverage length portion of two nearly parallel 3d line segments
I am having many pair of 3d line segments. the case is, in non of the pair, one line segment with respect to other one is not parallel but nearly parallel withing (5-10 degree threshold).
if i take ...
2
votes
1answer
36 views
Angle between different rays (3d line segments) and computing their angular relationships
I have several positions (say A,B,C,..) and I know their coordinates
(3d). From each point, if a certain ray is passing in a way to
converge them at a given (known) point (say O). This point O ...
1
vote
0answers
33 views
viewing ray geometry - with multiple aerial photographs
I am working with multiple aerial images. My idea is to model 3d objects (only upper parts). I am having known orientation parameters. As I am new to this field so that, I want to clarify few general ...
2
votes
1answer
31 views
Partitioning a set of rectangles into disjoint subsets each of which consists of disjoint rectangles
Suppose we have a list $R$ of axis-aligned rectangles in the plane. There is the well-known problem of determining the maximum subset of $R$ which consists of disjoint rectangles; this problem is ...
2
votes
1answer
31 views
incident angles between rays, falling on an oblique plane
I am having really two simple questions, but following two things are confusing me.
Question 1
If I know plane parameter (v3) of a given plane (say AB); if a pair of
rays are incident at a ...
4
votes
0answers
85 views
Biggest ball included in an intersection of balls
I would like to prove that for any family of balls $\{B(c_i,r_i)\}_i \subset \mathbb{R}^d$ such that $\{c_1, \dots, c_n\} \subset \bigcap_i B(c_i,r_i) $ and $\forall i, r_i \geq 1$, there exists a ...
2
votes
1answer
71 views
Computational geometry
Computational geometry?
(Computational geometry) Given a set of n randomly scattered points for even
n = 2,4,6,...,50 . Find the maximum number of lines between the pairs of nodes in
such a way the ...
1
vote
1answer
43 views
Circle Packing: Unsolved Problem in Geometry?
Graham and Sloane minimize the second moment of the centres of a number discs in order to maximize their compactness. They use computational geometry techniques to find the optimal packings for ...
3
votes
1answer
44 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 ...
1
vote
2answers
55 views
How to find co ordinates of a triangle after increasing the area by a factor of $\alpha$?
i am given with a triangle $\{(x_1,y_1),(x_2,y_2),(x_3,y_3)\}$ and the area need to be increased by a factor $\alpha$. can i anyone let me know formula to find the co ordinates of new triangle? There ...
2
votes
1answer
32 views
How to estimate orientation errors of an image with respect to known data (line features)
I think this is very simple but for me, it is confusing to figure out a way.
Here is my problem.
I have been given a 3d line segment list obtained from a field survey. So I know each end point ...
1
vote
1answer
46 views
angle between steepest gradient of two plane
IF I have two 3d planes such as Oab and Oa'b'. If these two planes intersect a horizontal plane and the intersection of each plane makes AB and A'B' lines. then,
Does the angle between AB, A'B' ...
0
votes
1answer
39 views
$2$ planes and angle between them
IF I have two $3d$ planes such as Oab and Oa'b'. If these two planes intersect a horizontal plane and the intersection of each plane makes AB and A'B' lines. then,
Does the angle between AB, ...
5
votes
2answers
48 views
Find the most vertical line in a point set in $O(n \log n)$ time
Input: a set of $n$ points in general position in $\mathbb{R}^2$.
Output: the pair of points whose slope has the largest magnitude.
Time constraint: $O(n \log n)$ or better.
Please don't spoil the ...
