Efficient Groebner walk conversion for implicitization of geometric objects

Computer Aided Geometric Design

Volumn 21, Issue 9, 2004, Pages 837-857

  Tran, Quoc Nam ^a  

^a Rice University   (United States)

Author keywords

Groebner bases; Implicitization

Indexed keywords

ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; RELIABILITY;

GROEBNER BASES; GROEBNER WALK CONVERSION; IMPLICITIZATION; SYSTEM OF EQUATIONS;

COMPUTATIONAL GEOMETRY;

EID: 7444233707     PISSN: 01678396     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cagd.2004.07.001     Document Type: Article

References (25)

1. Arnon, D., Sederberg, T., 1984. Implicit equation for a parametric surface by Groebner basis. In: Proc. 1984 MACSYMA User's Conf. Schenectady, New York, USA, pp. 431-436.
2. Buchberger, B., 1965. An algorithm for finding a basis for the residue class ring of a zero-dimensional polynomial ideal. Ph.D. Thesis, Institute of Mathematics, Univ. Innsbruck, Innsbruck, Austria (in German).
3. Buchberger, B., 1985. Groebner Bases: An algorithmic method in polynomial ideal theory. In: Bose, N.K. (Ed.), Multidimensional Systems Theory. Reidel, Dordrecht, pp. 184-232. Chapter 6.
4. Buchberger B., June 1986. What can Groebner bases do for computational geometry and robotics, In: Proc. Workshop on Geometric Reasoning, Oxford, England.
5. Caniglia, L., Galligo, A., Heintz, J., 1991. Equations for the projective closure and effective nullstellensatz. Discrete Appl. Math. 33, 11-23.
6. Chen, F., Wang, W., 2003. Revisiting the μ-basis of a rational ruled surface. J. Symbolic Comput. 36, 699-716.
7. Chen, F., Zheng, J., Sederberg, T., 2001. The mu-basis of a rational ruled surface. Comput. Aided Geom. Design.
8. Collart, S., Kalkbrener, M., Mall, D., 1997. Converting bases with the Groebner walk. J. Symbolic Comput. 24 (3/4), 465-469.
9. Cox, D., Little, J., O'Shea, D., 1996. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, second ed. Undergraduate Texts in Mathematics. Springer, New York.
10. Cox, D., Sederberg, T., Chen, F., 1998. The moving line ideal basis of planar rational curves. Comput. Aided Geom. Design.
11. Crow, F., 1987. The origins of the teapot. IEEE Comput. Graphics Appl. 7 (1), 8-19.
12. Dubé, T.D., 1990. The structure of polynomial ideals and Groebner bases. SIAM J. Comput. 19 (4), 750-773.
13. Eisenbud, D., 1995. Commutative Algebra with a View Towards Algebraic Geometry. Graduate Texts in Math., vol. 150. Springer, New York.
14. Fix, G., Hsu, C.-P., Luo, T., 1996. Implicitization of rational parametric surfaces. J. Symbolic Comput. 21, 329-336.
15. Hoffmann, C., 1993. Implicit curves and surfaces in CAGD. IEEE Comput. Graph. Appl. 13, 79-88.
16. Hoffmann, C.M., 1989. Geometric and Solid Modeling - An Introduction. Morgan Kaufmann, San Mateo, CA.
17. Kalkbrener, M., 1990. Implicitization of rational curves and surfaces. In: AAECC-8, Tokyo, Japan. In: Lecture Notes in Comput. Sci., vol. 508. Springer, Berlin.
18. Manocha, D., Canny, J., 1992. Algorithm for implicitizing rational parametric surfaces. Comput. Aided Geom. Design 9 (1), 25-51.
19. Mora, T., Robbiano, L., 1988. The Groebner fan of an ideal. J. Symbolic Comput. 6, 183-208.
20. Robbiano, L., 1985. Term orderings on the polynomial ring. In: Proceedings of EUROCAL '85. In: Lecture Notes in Comput. Sci., vol. 204. Springer, Berlin, pp. 513-517.
21. Sederberg, T., Chen, F., 1995. Implicitization using moving curves and surfaces. In: Proc. Siggraph. ACM.
22. Sederberg, T.W., Anderson, D.C., 1984. Implicit representation of parametric curves and surfaces. Computer Vison, Graphics and Image Processing 28, 72-84.
23. Tran, Q.-N., 2000. A fast algorithm for Groebner basis conversion and its applications. J. Symbolic Comput. 30, 451-468.
24. Traverso, C., 1996. Hilbert functions and the Buchberger algorithm. J. Symbolic Comput. 22, 355-376.
25. van der Waerden, B.L., 1940. Moderne Algebra, vol. 2, second ed. Springer, Berlin.