opensim – Blame information for rev 1
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
1 | eva | 1 | /* The MIT License |
2 | * |
||
3 | * Copyright (c) 2010 Intel Corporation. |
||
4 | * All rights reserved. |
||
5 | * |
||
6 | * Based on the convexdecomposition library from |
||
7 | * <http://codesuppository.googlecode.com> by John W. Ratcliff and Stan Melax. |
||
8 | * |
||
9 | * Permission is hereby granted, free of charge, to any person obtaining a copy |
||
10 | * of this software and associated documentation files (the "Software"), to deal |
||
11 | * in the Software without restriction, including without limitation the rights |
||
12 | * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell |
||
13 | * copies of the Software, and to permit persons to whom the Software is |
||
14 | * furnished to do so, subject to the following conditions: |
||
15 | * |
||
16 | * The above copyright notice and this permission notice shall be included in |
||
17 | * all copies or substantial portions of the Software. |
||
18 | * |
||
19 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
||
20 | * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
||
21 | * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
||
22 | * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
||
23 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
||
24 | * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN |
||
25 | * THE SOFTWARE. |
||
26 | */ |
||
27 | |||
28 | using System; |
||
29 | using System.Collections.Generic; |
||
30 | using System.Diagnostics; |
||
31 | |||
32 | namespace OpenSim.Region.Physics.ConvexDecompositionDotNet |
||
33 | { |
||
34 | public class HullTriangle : int3 |
||
35 | { |
||
36 | public int3 n = new int3(); |
||
37 | public int id; |
||
38 | public int vmax; |
||
39 | public float rise; |
||
40 | private List<HullTriangle> tris; |
||
41 | |||
42 | public HullTriangle(int a, int b, int c, List<HullTriangle> tris) |
||
43 | : base(a, b, c) |
||
44 | { |
||
45 | this.tris = tris; |
||
46 | |||
47 | n = new int3(-1, -1, -1); |
||
48 | id = tris.Count; |
||
49 | tris.Add(this); |
||
50 | vmax = -1; |
||
51 | rise = 0.0f; |
||
52 | } |
||
53 | |||
54 | public void Dispose() |
||
55 | { |
||
56 | Debug.Assert(tris[id] == this); |
||
57 | tris[id] = null; |
||
58 | } |
||
59 | |||
60 | public int neib(int a, int b) |
||
61 | { |
||
62 | int i; |
||
63 | |||
64 | for (i = 0; i < 3; i++) |
||
65 | { |
||
66 | int i1 = (i + 1) % 3; |
||
67 | int i2 = (i + 2) % 3; |
||
68 | if ((this)[i] == a && (this)[i1] == b) |
||
69 | return n[i2]; |
||
70 | if ((this)[i] == b && (this)[i1] == a) |
||
71 | return n[i2]; |
||
72 | } |
||
73 | |||
74 | Debug.Assert(false); |
||
75 | return -1; |
||
76 | } |
||
77 | |||
78 | public void setneib(int a, int b, int value) |
||
79 | { |
||
80 | int i; |
||
81 | |||
82 | for (i = 0; i < 3; i++) |
||
83 | { |
||
84 | int i1 = (i + 1) % 3; |
||
85 | int i2 = (i + 2) % 3; |
||
86 | if ((this)[i] == a && (this)[i1] == b) |
||
87 | { |
||
88 | n[i2] = value; |
||
89 | return; |
||
90 | } |
||
91 | if ((this)[i] == b && (this)[i1] == a) |
||
92 | { |
||
93 | n[i2] = value; |
||
94 | return; |
||
95 | } |
||
96 | } |
||
97 | } |
||
98 | } |
||
99 | } |