Computing the Discrete Compactness  of Orthogonal Pseudo-Polytopes via Their <svg style="vertical-align:-0.144pt;width:12.38625px;" id="M1" height="11.31" version="1.1" viewBox="0 0 12.38625 11.31" width="12.38625"  xmlns="http://www.w3.org/2000/svg">
	<g transform="matrix(1.25,0,0,-1.25,0,11.31)">
		<text transform="matrix(1,0,0,-1,0.498,0.642)">
			<tspan style="font-size: 17.93px; " x="0" y="0">𝑛</tspan>
		</text>

	</g>
</svg>D-EVM Representation

<table>A 2D-OPP <math id="M393" xmlns="http://www.w3.org/1998/Math/MathML"><mrow><mi>q</mi></mrow></math> whose area is being computed (see text for details).</table>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: Computing the Discrete Compactness  of Orthogonal Pseudo-Polytopes via Their <svg style="vertical-align:-0.144pt;width:12.38625px;" id="M1" height="11.31" version="1.1" viewBox="0 0 12.38625 11.31" width="12.38625"  xmlns="http://www.w3.org/2000/svg">
	<g transform="matrix(1.25,0,0,-1.25,0,11.31)">
		<text transform="matrix(1,0,0,-1,0.498,0.642)">
			<tspan style="font-size: 17.93px; " x="0" y="0">𝑛</tspan>
		</text>

	</g>
</svg>D-EVM Representation 

Mathematical Problems in Engineering

Computing the Discrete Compactness of Orthogonal Pseudo-Polytopes via Their 𝑛 D-EVM Representation

Figure 4

Computing the Discrete Compactness of Orthogonal Pseudo-Polytopes via Their D-EVM Representation