usage: vis [-threads #] [-level 0-4] [fast] [-v] bspfile
This will only calculate a very loose visibility list. It doesn't take much time to calculate, but a lot more polygons will be drawn by the Q3 engine than necessary.
[0-4] not used
This merges bsp leaves before calculating the visibility list. This will speed up the vis calculations, but a lot more polygons will be drawn by the Q3 engine than necessary.
This will disable the passage visibility algorithm. The passage vis is faster, and a bit more tight, than the old algorithm.
This disables the sorting of portals by complexity. Generally, sorting will speed up visibility calculations, because portals that are more complex can use information from less complex portals.
see nopassage
This disables automatic deletion of the .prt file after creating the visibility list.
(N) This sets the number of threads used to compile the map. For the fastest compile times, the number of threads should be set to the number of system processors.
(path) The input files will be read from a folder called “tmp”.
(path) The output files will be written to a folder called “tmp”.
Outputs verbose information.