Advertisement

Computational geometry problems in REDLOG

  • Thomas Sturm
  • Volker Weispfenning
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1360)

Abstract

We solve algorithmic geometrical problems in real 3-space or the real plane arising from applications in the area of cad, computer vision, and motion planning. The problems include parallel and central projection problems, shade and cast shadow problems, reconstruction of objects from images, offsets of objects, Voronoi diagrams of a finite family of objects, and collision of moving objects. Our tools are real elimination algorithms implemented in the reduce package redlog. In many cases the problems can be solved uniformly in unspecified parameters. The power of the method is illustrated by examples many of which have been outside the scope of real elimination methods so far.

Keywords

Voronoi Diagram Symbolic Computation Atomic Formula Central Projection Parallel Projection 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [ADY+96]
    Chaouki T. Abdallah, Peter Dorato, Wei Yang, Richard Liska, and Stanly Steinberg. Applications of quantifier elimination theory to control system design. In Proceedings of the 4th IEEE Mediterranean Symposium on Control and Automation, pages 340–345. IEEE, 1996.Google Scholar
  2. [BKOS97]
    Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry, Algorithms and Applications. Springer, Berlin, Heidelberg, New York, 1997.Google Scholar
  3. [Buc65]
    Bruno Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Doctoral dissertation, Mathematisches Institut, Universität Innsbruck, Innsbruck, Austria, 1965.Google Scholar
  4. [CH91]
    George E. Collins and Hoon Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299–328, September 1991.Google Scholar
  5. [CJ92]
    Robert M. Corless and David J. Jeffrey. Well ... it isn't quite that simple. ACM SIGSAM Bulletin, 26(3):2–6, August 1992.Google Scholar
  6. [CoL90]
    Alain Colmerauer. Prolog III. Communications of the ACM, 33(7):70–90, July 1990.CrossRefGoogle Scholar
  7. [DS96).
    Andreas Dolzmann and Thomas Sturm. Redlog user manual. Technical Report MIP-9616, FMI, Universität Passau, D-94030 Passau, Germany, October 1996. Edition 1.0 for Version 1.0.Google Scholar
  8. [DS97a]
    Andreas Dolzmann and Thomas Sturm. Guarded expressions in practice. In Wolfgang W. Küchlin, editor, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC 97), pages 376–383, New York, July 1997. ACM, ACM Press.Google Scholar
  9. [DS97b]
    Andreas Dolzmann and Thomas Sturm. Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2–9, June 1997.Google Scholar
  10. [DS97c]
    Andreas Dolzmann and Thomas Sturm. Simplification of quantifier-free formulae over ordered fields. Journal of Symbolic Computation, 24(2):209–231, August 1997.CrossRefGoogle Scholar
  11. [DSW96]
    Andreas Dolzmann, Thomas Sturm, and Volker Weispfenning. A new approach for automatic theorem proving in real geometry. Technical Report MIP-9611, FMI, Universität Passau, D-94030 Passau, Germany, May 1996. To appear in the Journal of Automated Reasoning.Google Scholar
  12. [HCJE93]
    Hoon Hong, George E. Collins, Jeremy R. Johnson, and Mark J. Encarnacion. QEPCAD interactive version 12. Kindly provided to us by Hoon Hong, September 1993.Google Scholar
  13. [HLS97]
    Hoon Hong, Richard Liska, and Stanly Steinberg. Testing stability by quantifier elimination. Journal of Symbolic Computation, 24(2):161–187, August 1997. Special Issue on applications of quantifier elimination.CrossRefGoogle Scholar
  14. [Hof96]
    Christoph M. Hoffmann. How solid is solid modeling. In Ming C. Lin and Dinesh Manocha, editors, Applied Computational Geometry, volume 1148 of Lecture Notes in Computer Science, pages 1–8, Berlin, Heidelberg, 1996. Springer.Google Scholar
  15. [KM88]
    Deepak Kapur and Joseph L. Mundy. Wu's method and its application to perspective viewing. Artificial Intelligence, 37(1-3):15–36, December 1988. Special volume on geometric reasoning.CrossRefGoogle Scholar
  16. [LW93]
    Rüdiger Loos and Volker Weispfenning. Applying linear quantifier elimination. The Computer Journal, 36(5):450–462, 1993. Special issue on computational quantifier elimination.CrossRefGoogle Scholar
  17. [PP97]
    Martin Peternell and Helmut Pottmann. Computing rational parametrizations of canal surfaces. Journal of Symbolic Computation, 23(2-3):255–266, February–March 1997.CrossRefGoogle Scholar
  18. [PS85]
    Franco P. Preparata and Michael I. Shamos. Computational Geometry—An Introduction. Texts and monographs in computer science. Springer, New York, 1985.Google Scholar
  19. [Ros85]
    Jaroslaw R. Rossignac. Blending and Offsetting Solid Models. Ph.D. thesis, Department of Electrical Engineering, College of Engineering and Applied Science, University of Rochester, Rochester, New York 14627, July 1985.Google Scholar
  20. [RR86]
    Jaroslaw R. Rossignac and Aristides A. G. Requicha. Offsetting operations in solid modelling. Computer Aided Geometric Design, 3(2):129–148, August 1986.CrossRefGoogle Scholar
  21. [Ser82]
    Jean Serra. Image Analysis and Mathematical Morphology. Academic Press, New York, 1982.Google Scholar
  22. [SW97]
    Thomas Sturm and Volker Weispfenning. Rounding and blending of solids by a real elimination method. In Achim Sydow, editor, Proceedings of the 15th IMACS World Congress on Scientific Computation, Modelling, and Applied Mathematics (IMACS 97), volume 2, pages 727–732, Berlin, August 1997. IMACS, Wissenschaft & Technik Verlag.Google Scholar
  23. [Wan93]
    Dongming Wang. An elimination method based on Seidenberg's theory and its applications. In F. Eyssette and A. Galligo, editors, Computational Algebraic Geometry (MEGA '92), pages 301–328. Birkhäuser Verlag, 1993.Google Scholar
  24. [Wei88]
    Volker Weispfenning. The complexity of linear problems in fields. Journal of Symbolic Computation, 5(1):3–27, February 1988.Google Scholar
  25. [Wei90]
    Volker Weispfenning. The complexity of almost linear diophantine problems. Journal of Symbolic Computation, 10(5):395–403, November 1990.Google Scholar
  26. [Wei94]
    Volker Weispfenning. Parametric linear and quadratic optimization by elimination. Technical Report MIP-9404, FMI, Universität Passau, D-94030 Passau, Germany, April 1994. To appear in the Journal of Symbolic Computation.Google Scholar
  27. [Wei97a]
    Volker Weispfenning. Complexity and uniformity of elimination in presburger arithmetic. In Wolfgang W. Küchlin, editor, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC 97), pages 48–53, New York, July 1997. ACM, ACM Press.Google Scholar
  28. [Wei97b]
    Volker Weispfenning. Quantifier elimination for real algebra—the quadratic case and beyond. Applicable Algebra in Engineering Communication and Computing, 8(2):85–101, February 1997.CrossRefGoogle Scholar
  29. [Wei97c]
    Volker Weispfenning. Simulation and optimization by quantifier elimination. Journal of Symbolic Computation, 24(2):189–208, August 1997. Special issue on applications of quantifier elimination.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Thomas Sturm
    • 1
  • Volker Weispfenning
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität PassauPassauGermany

Personalised recommendations