Solving polynomial systems for curve, surface and solid modeling

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Solving polynomial systems for curve, surface and solid modeling

Full text

Pdf (1.01 MB)

Source

ACM Symposium on Solid and Physical Modeling archive
Proceedings on the second ACM symposium on Solid modeling and applications table of contents

Montreal, Quebec, Canada

Pages: 169 - 178

Year of Publication: 1993

ISBN:0-89791-584-4

Author

Dinesh Manocha

Sponsor

SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 24, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/164360.164419 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	ABB+92	E. Anderson , Z. Bai , C. Bischof , L. S. Blackford , J. Demmel , Jack J. Dongarra , J. Du Croz , S. Hammarling , A. Greenbaum , A. McKenney , D. Sorensen, LAPACK Users' guide (third ed.), Society for Industrial and Applied Mathematics, Philadelphia, PA, 1999
	AS86	W. Auzinger and H.J. Stetter. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In International Series of Numerical Mathematics, volume 86, pages 11-30, 1986.
	BDM89	Z. Bai, J. Demmel, and A. McKenney. On the conditioning of the nonsymmetric eigenproblem: Theory and software. Computer Science Dept. Technical Report 469, Courant Institute, New York, NY, October 1989. (LA- PACK Working Note # 13).
	Ber75	D.N. Bernshtein. The number of roots of a system of equations. Funktsional'nyi A noliz i Ego Prilozheniila, 9(3):1-4, 1975.
	BGW88	C. Bajaj, T. Garrity, and J. Warren. On the applications of multi-equational resultants. Technical Report CSD-TR-826, Department of Computer Science, Purdue University, 1988.
	Can88	John F. Canny, The complexity of robot motion planning, MIT Press, Cambridge, MA, 1988
	CE93	John F. Canny , Ioannis Z. Emiris, An Efficient Algorithm for the Sparse Mixed Resultant, Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.89-104, May 10-14, 1993
	Cra89	John J. Craig, Introduction to Robotics: Mechanics and Control, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	Dix08	A.L. Dixon. The eliminant of three qualities in two independent variables. Proceedings of London Mathematical Society, 6:49-69, 209-236, 1908.
	GKZ90	I.M. Gelfand, M.M. Kapranov, and A.V. Zelevinsky. Newton polytopes of the cl.x~sical resultant and discriminant. Advances in Mathematics, 84:237-254, 1990.
	GL89	G.H. Golub and C.F. Van Loan. Matrix Computations. John Hopkins Press, Baltimore, 1989.
	GLR82	I. Gohberg, P. Lancaster, and L. R odman. Matrix Polynomials. Academic Press, New York, 1982.
	Gol91	David Goldberg, What every computer scientist should know about floating-point arithmetic, ACM Computing Surveys (CSUR), v.23 n.1, p.5-48, March 1991 [doi>10.1145/103162.103163]
	Hof89	Christoph M. Hoffmann, Geometric and solid modeling: an introduction, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1989
	Hof90	C. M. Hoffmann, A dimensionality paradigm for surface interrogations, Computer Aided Geometric Design, v.7 n.6, p.517-532, Nov. 1990 [doi>10.1016/0167-8396(90)90013-H]
	Kaj82	James T. Kajiya, Ray tracing parametric patches, ACM SIGGRAPH Computer Graphics, v.16 n.3, p.245-254, July 1982
	Kra91	Glenn A. Kramer, Using degrees of freedom analysis to solve geometric constraint systems, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.371-378, June 05-07, 1991, Austin, Texas, United States [doi>10.1145/112515.112566]
	LBD+92	David Lavender , Adrian Bowyer , James Davenport , Andrew Wallis , John Woodwark, Voronoi Diagrams of Set-Theoretic solid Models, IEEE Computer Graphics and Applications, v.12 n.5, p.69-77, September 1992 [doi>10.1109/38.156016]
	Mac02	F.S. Macaulay. On some formula in elimination. Proceedings ojf London Mathematical Society, pages 3-27, May 1902.
	Man92	Dinesh Manocha, Algebraic and numeric techniques in modeling and robotics, University of California at Berkeley, Berkeley, CA, 1992
	MC27	F. Morley and A.B. Cable. New results in elimination. American Journal of Mathematics, 49:463-488, 1927.
	MC91	D. Manocha and J.F. Canny. A new approach for surface intersection. International Journal of Computational Geometry and Applications, 1(4):491--516, 1991. Special issue on Solid Modeling.
	MD92	Dinesh Manocha , James Demmel, Algorithms for intersecting parametric and algebraic curves, Proceedings of the conference on Graphics interface '92, p.232-241, September 1992, Vancouver, British Columbia, Canada
	Mor92	A.P. Morgan. Polynomial continuation and its relationship to the symbolic reduction of polynomial systems. In Symbolic and Numerical Computation for Artificial Intelligence, pages 23-45, 1992.
	NSK90	Tomoyuki Nishita , Thomas W. Sederberg , Masanori Kakimoto, Ray tracing trimmed rational surface patches, ACM SIGGRAPH Computer Graphics, v.24 n.4, p.337-345, Aug. 1990
	Owe91	J. C. Owen, Algebraic solution for geometry from dimensional constraints, Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications, p.397-407, June 05-07, 1991, Austin, Texas, United States [doi>10.1145/112515.112573]
	RR92	Aristides A. G. Requicha , Jarek R. Rossignac, Solid Modeling and Beyond, IEEE Computer Graphics and Applications, v.12 n.5, p.31-44, September 1992 [doi>10.1109/38.156011]
	Sal85	G. Salmon. Lessons lntroducto~ to the Modern Higher Algebra. G.E. Stechert & Co., New York, 1885.
	Sed83	Thomas Warren Sederberg, Implicit and parametric curves and surfaces for computer aided geometric design, 1983
	SP86	Thomas W Sederberg , Scott R Parry, Comparison of three curve intersection algorithms, Computer-Aided Design, v.18 n.1, p.58-64, Jan/Feb. 1986 [doi>10.1016/S0010-4485(86)80013-6]
	Ste76	G.W. Stewaxt. Simultaneous iteration for computing invaxiant subspaces of non-hermitian m~trices. Numerische Mathematik, 25:123- 136, 1976.
	Stu91	B. Sturmfels. Spaxse elimination theory. In D. Eisenbud and L. Robbiano, editors, Compu. tational Algebraic Geomet~ and Commutative Algebra. Cambridge University Press, 1991.
	SZ92	B. Sturmfels and A. Zelevinsky. Multigraded resultants of sylvester type. Journal of Algebra, 1992.
	Wil59	J.H. Wilkinson. The evaluation of the zeros of ill-conditioned polynomials, parts i and ii. Numer. Math., 1:150-166 and 167-180, 1959.