normal transform
来源:互联网 发布:金牛考勤软件电话 编辑:程序博客网 时间:2024/04/24 12:27
conclusion:
if T is orthogonal
n' = Tn
else
n' = inverse(transpose(T))n
Proof:
normal n, arbitray point p1, p2 on plane.
dot(n, (p1- p2)) = 0 ==> transpose(n)(p1 - p2) = 0 ① (matrix version of dot)
so transpose(n')(p1' - p2') = 0
==> transpose(n')(Tp1 - Tp2) = 0
==> transpose(n')T(p1 - p2) = 0 ②
① ② ==> transpose(n) = transpose(n')T
==> n = transpose(T)n'
==> n' = inverse(transpose(T))n
0 0
- normal transform
- 法线变换详解(Normal Transform)
- 法线变换详解(Normal Transform)
- normal
- Normal
- 霍夫变换的标准形式--The Hough Transform: Normal form
- transform
- Transform
- transform
- transform
- transform
- transform
- Transform
- transform
- transform
- transform
- transform
- transform
- GIT版本管理工具
- Java基本功练习十六(继承和多态【继承多态覆盖练习、多重继承、数组线性表ArrayList、银行账户类升级】)
- [leetcode 82] Remove Duplicates from Sorted List II
- mfc
- 学习TabControl
- normal transform
- 但是 同时
- git初步使用心得(一)
- 自我服务偏见
- 入门训练 圆的面积
- 14_android进度条对话框的使用说明
- 红黑树深入浅出
- 获取NGUI的输入框内容的方法
- 几款不错的VisualStudio2010插件