1. Description of the problem
- classification of types of reflection curves: concave/convex/having
inflections (like one is done in optics but in more general case)
- phenomena of self-intersecting and singularities
- multidimensional case and so on
2. Precise study of the class of curves as
smooth/differentiable/continuous ... at least necessary requirements
3. At the end we need a formula which can be evaluated on the computer,
something like you find here in the case of linear algebra
http://en.wikipedia.org/wiki/Reflection_%28linear_algebra%29.
4. Then we'll need to invent and to write the fast algorithm to evaluate
the reflected curve!
This is short expansion of the question.
This week I was trying to do some analysis. The thing I saw was that one can
consider something similar to moving frame along the reflection curve, then
making the change of coordinates the reflection line will be just
straightened, so one may consider now the classical reflection over a line.
(Sorry for quite schematic description)
I cannot ask you to solve this problem!!
What is important for me to get some books-references!
Thank you again for the help!
Igor.
Draw a line from the point being reflected to the curve; draw
the tangent at the curve; do the obvious thing.
1) If the distance between eyes is negligible (monocular vision):
a) find a point on the curve where incoming/outgoing angles are equal.
b) make inversion w.r.t. the kissing circle;
2) Otherwise you need to find two points in "a", for left and for
right eye, and take the intersection of corresponding "vision rays".
Hope this helps,
Ilya
Igor Moiseev <moisee...@gmail.com> wrote:
--
Robert Israel isr...@math.MyUniversitysInitials.ca
Department of Mathematics http://www.math.ubc.ca/~israel
University of British Columbia Vancouver, BC, Canada
So I meant with reflection this staff:
http://en.wikipedia.org/wiki/Reflection_%28mathematics%29
Igor.
In article <hd921e$j4r$1...@dizzy.math.ohio-state.edu>,
compute the point on the curve say xc, which is nearest to your point,
say xp.
then xr=xp+2*(xc-xp)
the computation of xc will be a nonlinear minimization problem in one
variable, the curve parameter s. Provided you have a formula for that
curve this should be manageable by a mimimizer. but you must be aware that
this may be a nonconvex problem with local minimizers. if you have the
curve represented by a list of points, simple do a list search in the
list of distances. this might also give a good starting point for case one.
hth
peter
Here you can see the brief lists of formulas and properties
http://en.wikipedia.org/wiki/Evolute
Thanks again. Igor.