Integer Approximation to the Intersection of Three Planes with Planar Constraints

  • Maharaj Mukherjee
  • George Nagy
  • Shashank Mehta
Conference paper
Part of the Focus on Computer Graphics book series (FOCUS COMPUTER)


The intersection point of three planes specified with rational coordinates is approximated by a point with integer-valued coordinates so that the integer point is constrained within the pyramid specified by three half-spaces of the planes. An O(N log N) algorithm guarantees that the obtained integer point is closest to the apex of the pyramid. An O(log N) algorithm, not yet proven to guarantee the closest point, yields promising results.


Rational Number Solution Point Integer Point Original Domain Minimum Integer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    D. Dobkin and D. Silver. Recipes for geometry and numerical analysis - part I: An empirical study. In Proceedings of the ACM Symposium on Computational Geometry, pages 93 7 105. Champaign-Urbana, Illinois, June 1988.Google Scholar
  2. [2]
    D. H. Greene and F. F. Yao. Finite resolution computational geometry. In Proceedings of Twenty-seventh Annual IEEE-FOCS Conference, pages 143 — 152. Toronto, Canada, October 1986.Google Scholar
  3. [3]
    L. Guibas, D. Salesin, and J. Stolfi. Epsilon-geometry: Building robust algorithms from imprecise computations. In Proceedings of the ACM Symposium on Computational Geometry, pages 208–217. Saarbrücken, Germany, June 1989.Google Scholar
  4. [4]
    C. M. Hoffmann, J. E. Hoperoft, and M. S. Karasick. Robust set operations on polyhedral solids. IEEE Computer Graphics & Applications, 9 (6): 50–59, November 1989.CrossRefGoogle Scholar
  5. [5]
    D. E. Knuth. The Art of Computer Programming - Seminumerical Algorithms (Vol. II). Addison Wesley, 1981.Google Scholar
  6. [6]
    J. C. Lagarias. The computational complexity of simultaneous Diophantine approximation problems. In Proceedings of Twenty-third Annual IEEE-FOCS Conference, pages 32–39, 1982.Google Scholar
  7. [7]
    A. K. Lenstra. Polynomial factorization by root approximation. In J. Fitch, editor, Lecture Notes on Computer Science: Int. Symp. Symbolic and Algebraic Computations, volume 174, pages 272–276. Springer-Verlag, 1984.Google Scholar
  8. [8]
    A. K. Lenstra, H. W. Lenstra, and L. Lovâsz. Factoring polynomials with rational coefficients. Math. Ann., 261: 515–534, 1982.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    L. R. Nackman M. S. Karasick, D. Lieber. Efficient Delaunay triangulation using rational arithmetic. IBM Research Report, RC 14455, IBM Research Division, Yorktown Heights, New York, March 1989.Google Scholar
  10. [10]
    D. W. Matula and P. Kornerup. Foundations of Finite Precision Rational Arithmetic. In Computing, Suppl 2, pages 85–111. Springer-Verlag, 1980.Google Scholar
  11. [11]
    S. Mehta, M. Mukherjee, and G. Nagy. Constrained integer approximation to 2-D line intersections. In Proceedings Second Canadian Conf. on Computational Geometry, pages 302–305. Ottawa, Canada, August 1990.Google Scholar
  12. [12]
    S. Mehta, M. Mukherjee, and G. Nagy. Constrained integer approximation to planar line intersections. Information Processing Letters, 40 (3): 137–139, November 1991.MathSciNetMATHCrossRefGoogle Scholar
  13. [13]
    V. J. Milenkovic. Verifiable implementations of geometric algorithms using finite precision arithmetic. In D. Kapur and J. L. Mundy, editors, Geometric Reasoning, pages 377–401. Cambridge, Massachusetts, MIT Press, 1989.Google Scholar
  14. [14]
    R. E. Moore. Interval Analysis. Prentice Hall, Englewood Cliffs, New Jersey, 1966.MATHGoogle Scholar
  15. [15]
    M. Segal and C. H. Sequin. Consistent calculations for solid modeling. In Proceedings of the ACM Symposium on Computational Geometry, pages 29 — 38. Baltimore, Maryland, June 1985.Google Scholar
  16. [16]
    J. Vignes. New methods for evaluating the validity of mathematical computations. In Mathematics and Computers in Simulation, volume 20, pages 227–249, 1978.Google Scholar
  17. [17]
    J. H. Wilkinson. Rounding Errors in Algebraic Processes. Prentice Hall Inc., Englewood Cliffs, New Jersey, 1963.MATHGoogle Scholar

Copyright information

© EUROGRAPHICS The European Association for Computer Graphics 1992

Authors and Affiliations

  • Maharaj Mukherjee
  • George Nagy
  • Shashank Mehta

There are no affiliations available

Personalised recommendations