Applications of Gröbner bases in non-linear computational geometry

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 296 LNCS, Issue , 1988, Pages 52-80

  Buchberger, Bruno ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; GEOMETRY; INVERSE KINEMATICS; POLYNOMIALS; ROBOT PROGRAMMING;

COLLISION DETECTION; CURVES AND SURFACES; GEOMETRICAL OBJECTS; GEOMETRICAL THEOREMS; MULTIVARIATE POLYNOMIAL; PARAMETRIC REPRESENTATIONS; POLYNOMIAL IDEAL THEORY; PRIMARY DECOMPOSITION;

INVERSE PROBLEMS;

EID: 85034654309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-18928-9_5     Document Type: Conference Paper

References (29)

1. D. S. ARNON, T. W. Sederberg, 1984. Implicit Equation for a Parametric Surface by Gröbner Bases. In: Proceedings of the 1984 MACSYMA User’s Conference (V. E. Golden ed.), General Electric, Schenectady, New York, 431-436.
2. H. Barr, 1981. Superquadrics and Angle-Preserving Transformations. IEEE Computer Graphics and Applications, 1/1, 11-23.
3. A BUCHBERGER, 1965. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal (German). Ph. D. Thesis, Univ. of Innsbruck (Austria), Dept, of Mathematics.
4. B. BUCHBERGER, 1970. An Algorithmic Criterion for the Solvability of Algebraic Systems of Equations (German). Aequationes Mathematicae 4/3, 374-383.
5. B. BUCHBERGER, G. E. Collins, R. Loos, 1982. “Computer Algebra: Symbolic and Algebraic Computation”. Springer-Verlag, Vienna - New York.
6. D. BUCHBERGER, 1985. Grõbner Bases: An Algorithmic Method in Polynomial Ideal Theory. In: Multidimensional Systems Theory (N. K. Bose ed.), D. Reidel Publishing Company, Dordrecht - Boston - Lancaster, 184-232.
7. G. E. COLLINS, 1975. Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition. 2nd GI Conference on Automata Theory and Formal Languages, Lecture Notes in Computer Science 33,134-183.
8. P. GLANNI, 1987. Properties of Grõbner Bases Under Specialization. Proc. of the EUROCAL’87 Conference, Leipzig, 2-5 June 1987, to appear.
9. P. Gianni, B. Trager, G. Zacharias, 1985. Grõbner Bases and Primary Decomposition of Polynomial Ideals. Submitted to J. of Symbolic Computation. Available as manuscript, IBM T. J. Watson Research Center, Yorktown Heights, New York.
10. D. HOFMANN, 1987. Algebraic Curves. This Volume. Institute for Mathematics and its Applications, U of Minneapolis.
11. D. HOFMANN, 1987a. Personal Communication. Purdue University, West Lafayette, IN 47907, Computer Science Dept.
12. M. KALKBRENER, 1987. Solving Systems of Algebraic Equations by Using Grõbner Bases. Proc. of the EUROCAL’87 Conference, Leipzig, 2-5 June 1987, to appear.
13. D. KAPUR, 1986. A Refutational Approach to Geometry Theorem Proving. In: Proceedings of the Workshop on Geometric Reasoning, Oxford University, June 30 - July 3, 1986, to appear in Artificial Intelligence.
14. D. KAPUR, 1987. Algebraic Reasoning for Object Construction from Ideal Images. Lecture Notes, Summer Program on Robotics: Computational Issues in Geometry, August 24-28, Institute for Mathematics and its Applications, Univ. of Minneapolis.
15. A. KANDRI-RODY, 1984. Effective Methods in the Theory of Polynomial Ideals. Ph. D. Thesis, Rensselaer Polytechnic Institute, Troy, New York, Dept, of Computer Science.
16. H. KREDEL, 1987. Primary Ideal Decomposition. Proc of the EUROCAL’87 Conference, Leipzig, 2-5 June 1987, to appear.
17. B. KUTZLER, 1987. Implementation of a Geometry Proving Package in SCRATCHPAD II. Proceedings of the EUROCAL’87 Conferenc, Leipzig, 2-5 June, 1987, to appear.
18. B. KUTZLER, S. STIFTER, 1986. On the Application of Buchberger’s Algorithm to Automated Geometry Theorem Proving. J. of Symbolic Computation, 2/4, 389-398.
19. D. LAZARD, 1985. Ideal Bases and Primary Decomposition: Case of Two Variables. J. of Symbolic Computation 1/3, 261-270.
20. R. P. PAUL, 1981. “Robot Manipulators: Mathematics, Programming, and Control”. The MIT Press, Cambridge (Mass.), London.
21. F. P. Preparata, M. I. Shamos, 1985. “Computational Geometry”. Springer-Verlag, New York, Berlin, Heidelberg.
22. T. W. SEDERBERG, D. C. Anderson, 1984. Implicit Representation of Parametric Curves and Surfaces. Computer Vision, Graphics, and Image Processing 28, 72-84.
23. D. SPEAR, 1977. A Constructive Approach to Ring Theory. Proc. of the MAC- SYMA Users’ Conference, Berkeley, July 1977 (R. J. Fateman ed.), The MIT Press, 369-376.
24. B. STURMFELS, 1987. Private Communication. Institute for Mathematics and its Applications.
25. W. TRINKS, 1978. On B. Buchberger’s Method for Solving Systems of Algebraic Equations (German). J. of Number Theory 10/4, 475-488.
26. D. Van DEN Essen, 1986. A Criterion to Decide if a Polynomial Map is Invertible and to Compute the Inverse. Report 8653, Catholic University Nijmegen (The Netherlands), Dept, of Mathematics.
27. D. L. Van der Waerden, 1953. “Modern Algebra I, II”, Frederick Ungar Publ. Comp., New York.
28. F. WLNKLER, 1986. Solution of Equations I: Polynomial Ideals and Grõbner Bases. Proc. of the Conference on Computers and Mathematics, Stanford University, July 30 - August 1, 1986, to appear.
29. W. T. Wu, 1978. On the Decision Problem and the Mechanization of Theorem Proving in Elementary Geometry. Scientia Sinica 21, 150-172.