Measurement of visualization ability of architectural space.
Many programs for the hidden lines on a surface are known [1] but these programs are long and need a large memory of the computer. In this paper we show algorithms and the corresponding mini-program in BASIC which can be implemented on minicomputers with plotters or plotting displays. We map the surface in the parallel or central projections.
We compute the global multiplicity of a 1-dimensional foliation along an integral curve in projective spaces. We give a bound in the way of Poincaré problem for a complete intersection curves. In the projective plane, this bound give us a bound of the degree of non irreducible integral curves in function of the degree of the foliation.