Constrained Delaunay Triangulation for Ad Hoc Networks

<table>Constraint
edge <svg height="18.65" id="M82" style="vertical-align:-2.34499pt" version="1.1" viewbox="0 0 18.525 18.65" width="18.525" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,18.65)">
<g transform="translate(72,-57.08)">
<g>
<path d="m -71.95,70.71 14.72,0" style="fill:none;stroke:#000000;stroke-width:0.82499999;stroke-linecap:butt;stroke-linejoin:miter;stroke-miterlimit:10;stroke-opacity:1;stroke-dasharray:none"></path>
</g>
<text transform="matrix(1,0,0,-1,-71.95,59.47)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑎</tspan>
<tspan style="font-size: 12.50px; " x="6.2765059" y="0">𝑓</tspan>
</text>
</g>
</g>
</svg> is added to
PLDel.</table>

Journal of Computer Networks and Communications

Constrained Delaunay Triangulation for Ad Hoc Networks

Figure 5