| 1 | /************************************************************************************ |
| 2 | |
| 3 | See SampleFramework license.txt for license terms. Unless required by applicable law |
| 4 | or agreed to in writing, the sample code is provided “AS IS” WITHOUT WARRANTIES OR |
| 5 | CONDITIONS OF ANY KIND, either express or implied. See the license for specific |
| 6 | language governing permissions and limitations under the license. |
| 7 | |
| 8 | ************************************************************************************/ |
| 9 | |
| 10 | using UnityEngine; |
| 11 | using System.Collections.Generic; |
| 12 | |
| 13 | /// <summary> |
| 14 | /// Procedurally generated capsule mesh which matches the character controller size. |
| 15 | /// This was originally created for visualizing the capsule in the HMD but it could be adapted to other purposes. |
| 16 | /// </summary> |
| 17 | [ExecuteInEditMode] |
| 18 | public class CharacterCapsule : MonoBehaviour |
| 19 | { |
| 20 | private CharacterController _character; |
| 21 | private MeshFilter _meshFilter; |
| 22 | |
| 23 | private float _height; |
| 24 | private float _radius; |
| 25 | |
| 26 | [Range(4,32)] |
| 27 | public int SubdivisionsU; |
| 28 | |
| 29 | [Range(4, 32)] |
| 30 | public int SubdivisionsV; |
| 31 | |
| 32 | private int _subdivisionU; |
| 33 | private int _subdivisionV; |
| 34 | |
| 35 | private Vector3[] _vertices; |
| 36 | private int[] _triangles; |
| 37 | |
| 38 | // Update is called once per frame |
| 39 | void Update () |
| 40 | { |
| 41 | if (_character == null) |
| 42 | { |
| 43 | _character = GetComponentInParent<CharacterController>(); |
| 44 | if (_character == null) |
| 45 | { |
| 46 | return; |
| 47 | } |
| 48 | } |
| 49 | |
| 50 | if (_height == _character.height |
| 51 | && _radius == _character.radius |
| 52 | && _subdivisionU == SubdivisionsU |
| 53 | && _subdivisionV == SubdivisionsV) |
| 54 | { |
| 55 | return; |
| 56 | } |
| 57 | |
| 58 | _height = _character.height; |
| 59 | _radius = _character.radius; |
| 60 | _subdivisionU = SubdivisionsU; |
| 61 | _subdivisionV = SubdivisionsV; |
| 62 | |
| 63 | List<Vector3> verts = new List<Vector3>(); |
| 64 | |
| 65 | var vector = new Vector3(1,0,0); |
| 66 | |
| 67 | // Generate the mesh |
| 68 | var topOffset = new Vector3(0, _height/2.0f - _radius, 0); |
| 69 | var bottomOffset = new Vector3(0, _radius - _height/2.0f, 0); |
| 70 | |
| 71 | // Add all the necessary vertices |
| 72 | verts.Add(new Vector3(0, _height/2.0f, 0)); |
| 73 | |
| 74 | for (int u = SubdivisionsU - 1; u >= 0; u--) |
| 75 | { |
| 76 | float uf = (float) u / (float) SubdivisionsU; |
| 77 | for (int v = 0; v < SubdivisionsV; v++) |
| 78 | { |
| 79 | float vf = (float) v / (float) SubdivisionsV; |
| 80 | var q = Quaternion.Euler(0, vf * 360.0f, uf * 90.0f); |
| 81 | var vert = q * vector; |
| 82 | vert *= _radius; |
| 83 | var v1 = vert + topOffset; |
| 84 | verts.Add(v1); |
| 85 | } |
| 86 | } |
| 87 | |
| 88 | for (int u = 0; u < SubdivisionsU; u++) |
| 89 | { |
| 90 | float uf = (float)u / (float)SubdivisionsU; |
| 91 | for (int v = 0; v < SubdivisionsV; v++) |
| 92 | { |
| 93 | float vf = (float)v / (float)SubdivisionsV; |
| 94 | var q = Quaternion.Euler(0, vf * 360.0f + 180.0f, uf * 90.0f); |
| 95 | var vert = q * vector; |
| 96 | vert *= _radius; |
| 97 | var v2 = bottomOffset - vert; |
| 98 | verts.Add(v2); |
| 99 | } |
| 100 | } |
| 101 | verts.Add(new Vector3(0, -_height / 2.0f, 0)); |
| 102 | |
| 103 | |
| 104 | // Setup all the triangles |
| 105 | |
| 106 | List<int> tris = new List<int>(); |
| 107 | int index; |
| 108 | int i; |
| 109 | |
| 110 | // top cap |
| 111 | for (int v = 0; v < SubdivisionsV; v++) |
| 112 | { |
| 113 | i = 0; |
| 114 | tris.Add(i); |
| 115 | tris.Add(v); |
| 116 | tris.Add(v+1); |
| 117 | } |
| 118 | tris.Add(0); |
| 119 | tris.Add(SubdivisionsV); |
| 120 | tris.Add(1); |
| 121 | |
| 122 | // top hemisphere |
| 123 | for (int u = 0; u < SubdivisionsU - 1; u++) |
| 124 | { |
| 125 | index = u * SubdivisionsV + 1; |
| 126 | for (int v = 0; v < SubdivisionsV - 1; v++) |
| 127 | { |
| 128 | i = index + v; |
| 129 | tris.Add(i); |
| 130 | tris.Add(i + SubdivisionsV); |
| 131 | tris.Add(i + 1); |
| 132 | |
| 133 | tris.Add(i + 1); |
| 134 | tris.Add(i + SubdivisionsV); |
| 135 | tris.Add(i + SubdivisionsV + 1); |
| 136 | } |
| 137 | i = index + SubdivisionsV - 1; |
| 138 | tris.Add(i); |
| 139 | tris.Add(i + SubdivisionsV); |
| 140 | tris.Add(i + 1 - SubdivisionsV); |
| 141 | |
| 142 | tris.Add(i + 1 - SubdivisionsV); |
| 143 | tris.Add(i + SubdivisionsV); |
| 144 | tris.Add(i + 1); |
| 145 | } |
| 146 | |
| 147 | // center tube |
| 148 | index = (SubdivisionsU - 1) * SubdivisionsV + 1; |
| 149 | for (int v = 0; v < SubdivisionsV - 1; v++) |
| 150 | { |
| 151 | i = index + v; |
| 152 | tris.Add(i); |
| 153 | tris.Add(i + SubdivisionsV); |
| 154 | tris.Add(i + 1); |
| 155 | |
| 156 | tris.Add(i + 1); |
| 157 | tris.Add(i + SubdivisionsV); |
| 158 | tris.Add(i + SubdivisionsV + 1); |
| 159 | } |
| 160 | i = index + SubdivisionsV - 1; |
| 161 | tris.Add(i); |
| 162 | tris.Add(i + SubdivisionsV); |
| 163 | tris.Add(i + 1 - SubdivisionsV); |
| 164 | |
| 165 | tris.Add(i + 1 - SubdivisionsV); |
| 166 | tris.Add(i + SubdivisionsV); |
| 167 | tris.Add(i + 1); |
| 168 | |
| 169 | // bottom hemisphere |
| 170 | for (int u = 0; u < SubdivisionsU - 1; u++) |
| 171 | { |
| 172 | index = u * SubdivisionsV + (SubdivisionsU * SubdivisionsV) + 1; |
| 173 | for (int v = 0; v < SubdivisionsV - 1; v++) |
| 174 | { |
| 175 | i = index + v; |
| 176 | tris.Add(i); |
| 177 | tris.Add(i + SubdivisionsV); |
| 178 | tris.Add(i + 1); |
| 179 | |
| 180 | tris.Add(i + 1); |
| 181 | tris.Add(i + SubdivisionsV); |
| 182 | tris.Add(i + SubdivisionsV + 1); |
| 183 | } |
| 184 | i = index + SubdivisionsV - 1; |
| 185 | tris.Add(i); |
| 186 | tris.Add(i + SubdivisionsV); |
| 187 | tris.Add(i + 1 - SubdivisionsV); |
| 188 | |
| 189 | tris.Add(i + 1 - SubdivisionsV); |
| 190 | tris.Add(i + SubdivisionsV); |
| 191 | tris.Add(i + 1); |
| 192 | } |
| 193 | |
| 194 | // bottom cap |
| 195 | var last = verts.Count - 1; |
| 196 | var lastRow = last - SubdivisionsV; |
| 197 | for (int v = 0; v < SubdivisionsV; v++) |
| 198 | { |
| 199 | i = 0; |
| 200 | tris.Add(last); |
| 201 | tris.Add(lastRow + v + 1); |
| 202 | tris.Add(lastRow + v); |
| 203 | } |
| 204 | tris.Add(last); |
| 205 | tris.Add(lastRow); |
| 206 | tris.Add(last - 1); |
| 207 | |
| 208 | |
| 209 | _vertices = verts.ToArray(); |
| 210 | _triangles = tris.ToArray(); |
| 211 | |
| 212 | _meshFilter = gameObject.GetComponent<MeshFilter>(); |
| 213 | _meshFilter.mesh = new Mesh(); |
| 214 | _meshFilter.sharedMesh.vertices = _vertices; |
| 215 | _meshFilter.sharedMesh.triangles = _triangles; |
| 216 | _meshFilter.sharedMesh.RecalculateNormals(); |
| 217 | } |
| 218 | } |
| 219 | |