There are many kinds of distances. One of them is Biharmonic Distance where I got the the image below from:

There are the numerous examples of biharmonic distance.

The biharmonic examples are on the left, and the author kept his promise in the paper that this distance keeps a fantastic balance between local properties of the underlying space as well global properties. I am slowly working my way through the paper and terms to be able to write a Mathematica program that can calculate biharmonic distance, but I am not a professional Mathematician/Mechanical Engineer. So a lot of the terms I don't understand without great difficulty in the paper, and I thought that this would be nice to share because it would be great if Mathematica had a function like BiharmonicPointDistance[spatialDataPoints,pointSource] which would give the results in the images above. But there also might be shortcuts built into the Wolfram Language that would make recomputing this easier.

Examples of the family of curves that I am interested in are shown below:

This is a circular sheet with dents in it.

This is a different circular sheet with dents in it.

which were all created with the code:

populateEllipse[center_, a_, b_, r_, pointQuantity_, maxAttempts_] :=
  {initialEllipse, ellipse, reg, pts = {}, n = 1, ellipseGraphics, parametricForms = {}, \[Theta], axes},
  ellipse = Disk[center, {a, b}];
  reg = RegionErosion[ellipse, r];

 initialEllipse = {center[[1]] + a Cos[t], center[[2]] + b Sin[t]};
  While[Length[pts] < pointQuantity && n <= maxAttempts,
    pts = RandomPointConfiguration[HardcorePointProcess[pointQuantity, 2 r, 2], reg];
    If[Length[pts["Points"]] > 0, Break[]]; (* Adjusted to exit loop if pts found *)
  pts = If[Length[pts["Points"]] > pointQuantity, Take[pts["Points"], pointQuantity], pts["Points"]];
  (* Generate ellipses and store parametric forms *)
  ellipseGraphics = Graphics[{
    Style[ellipse, FaceForm[None], EdgeForm[Black]],
    (axes = r RandomReal[{r, 2r}, 2];
     \[Theta] = RandomReal[{0, 2 \[Pi]}];
     AppendTo[parametricForms, {#[[1]] + axes[[1]] Cos[t] Cos[\[Theta]] - axes[[2]] Sin[t] Sin[\[Theta]], #[[2]] + axes[[1]] Cos[t] Sin[\[Theta]] + axes[[2]] Sin[t] Cos[\[Theta]]}];
     GeometricTransformation[Disk[#, axes], RotationTransform[\[Theta], #]]
    ) & /@ pts
  (* Return both initial ellipse and parametric forms for further use *)
  {initialEllipse, parametricForms}

    (plot = ParametricPlot[
         parametricForm, {t, 0, 2 Pi},
         Mesh -> pointQuantity, MeshFunctions -> {"ArcLength"}
    Point[l_] -> l, Infinity]

(* Define a function to append a unique negative z-value to each tuple within a sublist *)
modifySublist[sublist_] :=
Module[{z = -RandomReal[]},
  Table[Append[sublist[[i]], z], {i, 1, Length[sublist]}]

upperTopLayer=Table[Append[divyEllipsePerimeter[samplePoints,stored[[1]]][[i]], 0], {i, 1, samplePoints}];
bottomLayer= Map[{#[[1]], #[[2]], #[[3]] -diskHeight} &, topLayer];

ListPlot3D[topLayer,Axes->False,Boxed->False,ColorFunction -> "GrayTones"] 

which was motivated by Tad's answer from a previous post.

  • 1
    $\begingroup$ Not the harmonic distance, but related (an probably a solution to you problem): mathematica.stackexchange.com/a/175570/38178 $\endgroup$ Mar 13 at 0:59
  • $\begingroup$ @HenrikSchumacher I know all 3 distances use the Laplace Beltrami Operator. And I know the paths are unique for biharmonic unlike geodesic. So I am trying to understand that. I will look at your link. Thanks. $\endgroup$
    – Teg Louis
    Mar 13 at 1:30
  • 1
    $\begingroup$ Why we need to use Ellipse in Biharmonic Distance ? $\endgroup$
    – cvgmt
    Mar 13 at 4:15
  • 1
    $\begingroup$ In your BiharmonicPointDistance[spatialDataPoints, pointSource] what are spatialDataPoints and what are pointSource? $\endgroup$ Mar 23 at 11:15
  • 1
    $\begingroup$ There is a MATLAB code not too long. Have you tried to rewrite it in Mathematica? gfx.cs.princeton.edu/pubs/Lipman_2010_BD/index.php $\endgroup$ Mar 23 at 13:04


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.