Diff report
General
| Version 1 | Version 3 | |
|---|---|---|
| Variant | main - en | main - en |
| Document Name | Simple kd-Trees | (not changed) |
| Creation time | 9/1/05 4:34:55 PM | 5/12/10 11:09:05 AM |
| Created by | Adam Goode | Mike Baysek |
| State | publish | publish |
Changes to parts
Part Authors has changed
| Version 1 | Version 3 | |
|---|---|---|
| Mime type | text/xml | (not changed) |
| File name | (not changed) | |
| Size (bytes) | 110 | 117 |
Content diff
<html><body><p><a href="daisy:10224">Andrew Moore</a> <a href="daisy:10237">John Ostlund</a></p></body></html>
<html>
<body>
<p><a href="daisy:10224">Andrew Moore</a> <a href="daisy:10237">John Ostlund</a>
</p>
</body>
</html>
Part Description stayed the same
Part Point of contact has changed
| Version 1 | Version 3 | |
|---|---|---|
| Mime type | text/xml | (not changed) |
| File name | (not changed) | |
| Size (bytes) | 71 | 76 |
Content diff
<html><body><p><a href="daisy:10237">John Ostlund</a></p></body></html>
<html>
<body>
<p><a href="daisy:17066">Saswati Ray</a></p>
</body>
</html>
Part Changelog stayed the same
Changes to links
No changes detectedChanges to fields
| Version 1 | Version 3 | |
|---|---|---|
| Short description | This program constructs a kd-tree from the contents of an input dataset of k-dimensional vectors, and then performs nearest neighbor searches within the kd-tree using query points from a query dataset. The search can be either for K nearest neighbors, or | This program constructs a kd-tree from the contents of an input dataset of k-dimensional vectors, and then performs nearest neighbor searches within the kd-tree using query points from a query dataset. |