The attached files exemplify a bug in Doxygen 1.2.11 whereby the use of \if ... \endif causes the production of wrong LaTeX output. To reproduce: $ doxygen Doxyfile $ make ps then see what happens on page 1. All the best, Roberto -- Roberto Bagnara Computer Science Group Department of Mathematics, University of Parma, Italy http://www.cs.unipr.it/~bagnara/ mailto:bagnara@cs.unipr.it PROJECT_NAME = BugReport PROJECT_NUMBER = PPL.2 OUTPUT_DIRECTORY = . OUTPUT_LANGUAGE = English INPUT = definitions.dox GENERATE_LATEX = YES LATEX_OUTPUT = . COMPACT_LATEX = YES // Copyright (C) 2001 Roberto Bagnara <bagnara@cs.unipr.it> // // This document describes the Parma Polyhedra Library (PPL). // // Permission is granted to copy, distribute and/or modify this document // under the terms of the GNU Free Documentation License, Version 1.1 or // any later version published by the Free Software Foundation; with no // Invariant Sections, with no Front-Cover Texts, and with no Back-Cover // Texts. // // The PPL is free software; you can redistribute it and/or modify it // under the terms of the GNU General Public License as published by the // Free Software Foundation; either version 2 // of the License, or (at your option) any later version. // // The PPL is distributed in the hope that it will be useful, but WITHOUT // ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or // FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License // for more details. // // For the most up-to-date information see the Parma Polyhedra Library // site: http://www.cs.unipr.it/ppl/ /*! \mainpage Convex Polyhedra and the PPL \section introduction An Introduction to Convex Polyhedra The following definitions and results are taken from: - G. L. Nemhauser and L. A. Wolsey - Integer and Combinatorial Optimization - Wiley Interscience Series in Discrete Mathematics and Optimization, 1988. - D. K. Wilde - A library for doing polyhedral operations - IRISA Publication interne n. 785, December 1993. - K. Fukuda - Polyhedral Computation FAQ - Swiss Federal Institute of Technology, Lausanne and Zurich, Switzerland, October 2000. Be careful not to confuse the dimension \f$k\f$ of a polyhedron \f$P \subseteq R^n\f$ with the dimension \f$n\f$ of the enclosing vector space. (The following blurb is due to a bug in Doxygen.) \if Implementation_Info The following definitions and results are taken, in addition to the references mentioned before, from: - G. B Dantzig - Linear programming and extensions - Princeton University Press, New Jersey 1963. \section homogeneous Homogeneous Systems To simplify both the constraints and generators representations of a polyhedron \f$P \in R^n\f$, it is useful to map each point \f$\mathbf{x} \in R^n\f$ to a point \f$\mathbf{x}' = (\xi \mathbf{x}, \xi)^T \in R^{n + 1}\f$ where \f$\xi \geq 0\f$. \endif */