* [Caml-list] do we have a (fast) diameter of a point set implementation out there?
@ 2018-01-19 5:53 Francois BERENGER
0 siblings, 0 replies; only message in thread
From: Francois BERENGER @ 2018-01-19 5:53 UTC (permalink / raw)
To: caml-list
Hello,
Provided that a distance function between points is known,
is there some open source OCaml implementation out there?
I would be fine with an exact (but efficient) algorithm, or a less
exact one that guarantees a max error bound on the diameter that is found.
Here is one exact algorithm example: "Computing the Diameter of a Point
Set", Gregoire Malandain and Jean-Daniel Boissonnat
https://hal.inria.fr/file/index/docid/72354/filename/RR-4233.pdf
Currently, I am using a heuristic for my problem, but
if I had access to an exact algorithm, I would give it a try.
Thanks,
Francois.
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2018-01-19 5:53 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2018-01-19 5:53 [Caml-list] do we have a (fast) diameter of a point set implementation out there? Francois BERENGER
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).