half extents

简介: blue line is hypotenuse From there you can simply linearly add Pi/4 to the angle (45 degrees), then use: newx = cos(newAngle)*dist; newy = sin(newAngle)*dist;   http://gamedev.

blue line is hypotenuse

From there you can simply linearly add Pi/4 to the angle (45 degrees), then use:

newx = cos(newAngle)*dist;
newy = sin(newAngle)*dist;

 

http://gamedev.stackexchange.com/questions/14733/aabb-of-rotated-sprite

目录
打赏
0
0
0
0
13
分享
相关文章
【已解决】ValueError: num_samples should be a positive integer value, but got num_samples=0
【已解决】ValueError: num_samples should be a positive integer value, but got num_samples=0
LeetCode 363. Max Sum of Rect No Larger Than K
给定一个非空二维矩阵 matrix 和一个整数 k,找到这个矩阵内部不大于 k 的最大矩形和。
120 0
LeetCode 363. Max Sum of Rect No Larger Than K
LeetCode 209. Minimum Size Subarray Sum
给定一个含有 n 个正整数的数组和一个正整数 s ,找出该数组中满足其和 ≥ s 的长度最小的连续子数组。如果不存在符合条件的连续子数组,返回 0。
150 0
LeetCode 209. Minimum Size Subarray Sum
ValueError: Sample larger than population or is negative
ValueError: Sample larger than population or is negative
211 0
成功解决ValueError: min_samples_split must be an integer greater than 1 or a float in (0.0, 1.0]; got th
成功解决ValueError: min_samples_split must be an integer greater than 1 or a float in (0.0, 1.0]; got th
算法题丨Longest Consecutive Sequence
描述 Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
1132 0
1104. Sum of Number Segments (20) consecutive subsequence 每个数出现的次数
Given a sequence of positive numbers, a segment is defined to be a consecutive subsequence.
990 0
AI助理

你好,我是AI助理

可以解答问题、推荐解决方案等