You are an expert in writing code in many different languages. Your goal is to perform code completion for the following code, keeping in mind the rest of the code and the file meta data.
    Metadata details:
    filename: polyOrderDelaunay.m
    path of file: ./repos/GIBBON/lib
    
    the code of the file until where you have to start completion: function [V_fix,indFix]=polyOrderDelaunay(V,fd)

%%
% N.B. FUNCTION UNFINISHED AND NOT FULLY VALIDATED

%%
% Get Delaunay tesselation of points set
DT=delaunayTriangulation(V);
% Vd=DT.Points;
nPointsOriginal=size(V,1);

% Add Voronoi vertices to set
Vv = DT.voronoiDiagram();

    
function [V_fix,indFix]=polyOrderDelaunay(V,fd)

%%
% N.B. FUNCTION UNFINISHED AND NOT FULLY VALIDATED

%%
% Get Delaunay tesselation of points set
DT=delaunayTriangulation(V);
% Vd=DT.Points;
nPointsOriginal=size(V,1);

% Add Voronoi vertices to set
Vv = DT.voronoiDiagram();
Vv=Vv(any(~isinf(Vv),2),:); %Remove infinity vertex
DT.Points=[DT.Points;Vv];

% The Delaunay edges that connect pairs of sample points represent the
% boundary.
edgeInd = DT.edges();
logicBoundaryEdges=all(edgeInd<=nPointsOriginal,2);
E = edgeInd(logicBoundaryEdges,:);

%Removing invalid edges
D=sqrt(sum((V(E(:,1),:)-V(E(:,2),:)).^2,2));
L_invalid=(D./mean(D(:)))>fd;
E=E(~L_invalid,:);

indUni=unique(E(:));
indFix=nan(numel(indUni),1);

Ec=E;
sizE=size(E);

%% Loop to get path

q=1;
indNow=indUni(1);
% hp=[];
while 1    
    if q==numel(indUni)+1
        break
    end