<br><br><div><span class="gmail_quote">On 23/04/2008, <b class="gmail_sendername">Willi Richert</b> <<a href="mailto:richert@c-lab.de">richert@c-lab.de</a>> wrote:</span><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hi,<br> <br> thanks for the view. Do you then actually use the "logarithmic method" as<br> proposed by the BKD authors? I mean, they claim in their paper to guarantee<br> amortized log time operations (insert, remove, find). As your code looks much<br>
cleaner and shorter to me I wonder which other method besides BKD you use to<br> maintain that guarantee. How costly actually is the rebalancing subsequent to<br> insert/remove?</blockquote><div><br>i didn't read that much in depth actually, so i can't comment on the log method. and sorry but its been a while since i've read the code to comment on the rebalancing costs. lets see if someone else says something on that. i forgot to CC the list, i remembered this time.<br>
</div><br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;"> The next days I will examine how I could wrap it in Python. If someone is<br> interested please let me know.</blockquote>
<div><br>i am not personally interested, but more exposure would also help to increase the user base and thus the developer base.</div><br>one key part of libkdtree is that it is heavy on templates, so i assume you'd have to specify a fixed set of datatypes and accessors for the python wrapper?<br>
</div><br>