| 207 |
|
of the above would help to merge them. The most sure-fire approach to |
| 208 |
|
linking identical vertices is therefore to hash the point and normal |
| 209 |
|
values directly and use the functions in lookup.c to associate them. |
| 210 |
< |
You will have to write your own hash function, and I recommend making |
| 210 |
> |
You will have to write your own hash function, and we recommend making |
| 211 |
|
one that allows a little slop so that nearly identical points hash to |
| 212 |
|
the same value. |
| 213 |
|
|
| 239 |
|
worked out. The intent is to offer it free of charge to all those who |
| 240 |
|
wish to use it (with no guarantees, of course). However, we may decide |
| 241 |
|
that copyright protections are necessary to prevent unauthorized versions |
| 242 |
< |
of the parser that do not properly support the MGF standard from getting |
| 243 |
< |
spread around. Since this is a pre-release, we trust that you will not |
| 244 |
< |
share it with anyone without getting our permission first. |
| 242 |
> |
of the parser, which do not properly support the MGF standard, from |
| 243 |
> |
getting spread around. Since this is a pre-release, we trust that you |
| 244 |
> |
will not share it with anyone without getting our permission first. |
| 245 |
|
|
| 246 |
|
Questions |
| 247 |
|
========= |
