The study of computer algorithms which admit geometric descriptions, and geometric problems arising in association with such algorithms. The two major classes of problems are (a) efficient design of algorithms and data classes using geometric concepts and (b) representation and modelling of curves ...
1
vote
2answers
53 views
Approximating Euclidean geometry, restricted to $\mathbb{Q}$
I'm having trouble putting this into a fully coherent question, so I'll give the broad question, then a few bullet points to give you a better idea of what I'm asking.
I'm looking for a line of ...
0
votes
0answers
66 views
optimization function: sum of root squares of sum of two quadratic
Full question (same question in jpg, pdf and doc\docx):
https://drive.google.com/folderview?id=0BxFEf1J4iYVeX2l2NlVjUldEUlE&usp=sharing
Hello
I am a graduate student in computer science, making ...
3
votes
1answer
43 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 ...
0
votes
1answer
32 views
Winding a space curve
Can I find parametric equations for a curve that is winding another curve, which I know -- let's say it's $\vec{f}(t) = (x(t), y(t), z(t)) = \{\sin (t)+2 \sin (2 t), \cos (t)-2 \cos (2 t), -\sin (3 ...
1
vote
1answer
26 views
Fragemented linear feature alignment technique
I am having set of linear features lie on a plane (it does
not a matter whether the pane is vertical or horizontal). all linear
features are either parallel or othogonal to the vertical axis or ...
0
votes
1answer
36 views
Perpendicular to a vector at point on the vector
I am working with a model where I have to calculate a perpendicular to a vector through two points $\mathrm{P_1}$ and $\mathrm{P_2}$ (3d) at point $\mathrm{P_3}$ on the line joining these points.
...
1
vote
2answers
45 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 ...
1
vote
1answer
68 views
Lloyd's algorithm in normed vector spaces
How do I run Lloyd's algorithm in a normed vector space?
The space:
L*a*b* color space, finite sRGB segment, $R^3$
The distance metric:
CIE94 using L*C*h* information derived from the L*a*b* ...
2
votes
1answer
25 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
30 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
34 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, ...
0
votes
0answers
10 views
The different values of number of points to be compared in closest pair of points problem
I understand that this issue has been discussed before, but I see different
values of number of points to be compared in the combine (conquer) step in the divide-and-conquer approach to the closest ...
0
votes
1answer
33 views
obtainig a line 3D from multi view geometry
If I have been given multiple view images having known orientation parameters, then from a selected image line segment (corresponding line segments from each image) how could I compute a line 3D in ...
0
votes
1answer
21 views
Steepest slope gradient of a vertical plane
I know the steepest slope gradient (Azimuth) of a 3D plane can be
obtained by projecting normal vector onto XY Plane.
So, when the plane is slant, the steepest gradient will be a some value.
...
1
vote
1answer
39 views
Predicting the size of epsilon-net in SU(2)
I'm writing an algorithm that takes as input a finite set of matrices in SU(2) and consequently tries to generate an '$\epsilon$-net' by computing all possible matrix products (up to a given depth). ...
