<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content="text/html; charset=gb2312" http-equiv=Content-Type>
<STYLE>
BLOCKQUOTE {
MARGIN-TOP: 0px; MARGIN-BOTTOM: 0px; MARGIN-LEFT: 2em
}
OL {
MARGIN-TOP: 0px; MARGIN-BOTTOM: 0px
}
UL {
MARGIN-TOP: 0px; MARGIN-BOTTOM: 0px
}
P {
MARGIN-TOP: 0px; MARGIN-BOTTOM: 0px
}
BODY {
LINE-HEIGHT: 1.5; FONT-FAMILY: ΢ÈíÑźÚ; COLOR: #000000; FONT-SIZE: 10.5pt
}
</STYLE>
<META name=GENERATOR content="MSHTML 9.00.8112.16441"></HEAD>
<BODY style="MARGIN: 10px">
<DIV><PRE>Hello,
I'm new to k-d trees and in fact libkdtree. I would to find all points
within distance r of a given point. I've downloaded the source and I'm
trying to compile the sample program test_kdtree.cpp on Visual Studio
.NET 2010. but I'm getting the error message:
c:\Downloads\src\libkdtree\kdtree++\kdtree.hpp(125) : error C2512:
'std::pointer_to_binary_function<_Arg1,_Arg2,_Result>::__ctor' : no
appropriate default constructor available
with
[
_Arg1=triplet,
_Arg2=size_t,
_Result=double
]
and
[
_Arg1=triplet,
_Arg2=size_t,
_Result=double
]
Can anyone please tell me how to solve this problem?
Thanks,
</PRE></DIV>
<DIV> </DIV>
<HR style="WIDTH: 210px; HEIGHT: 1px" align=left color=#b5c4df SIZE=1>
<DIV><SPAN><SPAN style="FONT-FAMILY: ËÎÌå; COLOR: #000000; FONT-SIZE: 10.5pt">
<DIV
style="WIDOWS: 2; TEXT-TRANSFORM: none; TEXT-INDENT: 0px; LETTER-SPACING: normal; FONT: 14px arial, sans-serif; WHITE-SPACE: normal; ORPHANS: 2; COLOR: rgb(34,34,34); WORD-SPACING: 0px; -webkit-text-size-adjust: auto; -webkit-text-stroke-width: 0px">
<DIV
style="WIDOWS: 2; TEXT-TRANSFORM: none; TEXT-INDENT: 0px; LETTER-SPACING: normal; FONT: 14px arial, sans-serif; WHITE-SPACE: normal; ORPHANS: 2; COLOR: rgb(34,34,34); WORD-SPACING: 0px; -webkit-text-size-adjust: auto; -webkit-text-stroke-width: 0px"><SPAN
style="FONT-FAMILY: Verdana; COLOR: #8e8e8e; FONT-SIZE: 10.5pt"></SPAN>
<DIV
style="WIDOWS: 2; TEXT-TRANSFORM: none; TEXT-INDENT: 0px; LETTER-SPACING: normal; FONT: 14px arial, sans-serif; WHITE-SPACE: normal; ORPHANS: 2; COLOR: rgb(34,34,34); WORD-SPACING: 0px; -webkit-text-size-adjust: auto; -webkit-text-stroke-width: 0px"><SPAN><SPAN
style="FONT-FAMILY: Verdana"><SPAN style="FONT-SIZE: 9pt"><SPAN
style="FONT-SIZE: 10pt"><SPAN style="FONT-SIZE: 10.5pt"><SPAN
style="TEXT-TRANSFORM: none; TEXT-INDENT: 0px; LETTER-SPACING: normal; FONT: 12px/18px Verdana, Tahoma, Helvetica, Arial, sans-serif; WHITE-SPACE: normal; COLOR: rgb(0,0,0); WORD-SPACING: 0px"><SPAN
style="FONT-FAMILY: Verdana"><SPAN style="FONT-SIZE: 9pt"><SPAN
style="FONT-SIZE: 10pt"><SPAN
style="COLOR: #969696; FONT-SIZE: 10.5pt"></SPAN></SPAN></SPAN></SPAN></SPAN></SPAN></SPAN></SPAN></SPAN></SPAN><SPAN
style="FONT-STYLE: normal; FONT-FAMILY: Arial; COLOR: #969696; FONT-SIZE: 10.5pt; FONT-WEIGHT: normal">Zhu
Zhe<BR>Ph.D. Candidate<BR>Graphics and Geometric Computing Group<BR>Department
of Computer Science and Technology<BR>Tsinghua University, Beijing,
China</SPAN></SPAN></SPAN></DIV></DIV></DIV></DIV></BODY></HTML>