This is a small study comparing the performance of

• bit pattern trees (bp-trees),
• bit pattern trees using query bits neutralization (bp-qbn-trees) and
• vantage point trees (vp-trees).

Table 1 contains the calculation times for the facet/vertex enumeration of different polytopes.

Table 1: Sum of narrowing and verification time (ms)

	bp-trees	bp-qbn-trees	vp-trees
rnd_36	1391816	206412	319208
rnd_cube	756334	715283	137963
ccp7	110480	53009	102915
metric_7	3463831	1028120	9393996
rnd_64	277641	222093	168125
c_4_26_2	118623	75201	117598
glue54	22933	7302	5582
trunc50	470003	582735	421080
Total:	6611661	2890155	10666467