styochastic approximation of proximity graph...

[aupetit]

Hello,

do you know some works about approximating a proximity graph,
that is finding a subgraph of Delaunay graph, using some stochastic
optimization process (The closer the subgraph to Delaunay, the better
the approximation).

Note that I have high-dimensionnal points (d>20) so I cannot afford a
straight computation of Delaunay graph (complexity scaling in
exponential of the dimension for D>3).

Thank you for your help


Michael



-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.