{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:21:24Z","timestamp":1770448884478,"version":"3.49.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T00:00:00Z","timestamp":1503532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>Implicitizing rational surfaces is a fundamental computational task in Computer Graphics and Computer Aided Design. Ray tracing, collision detection, and solid modeling all benefit from implicitization procedures for rational surfaces. The univariate resultant of two moving lines generated by a \u03bc-basis for a rational curve represents the implicit equation of the rational curve. But although the multivariate resultant of three moving planes corresponding to a \u03bc-basis for a rational surface is guaranteed to contain the implicit equation of the surface as a factor, \u03bc-bases for rational surfaces are difficult to compute. Moreover, \u03bc-bases for a rational surface often have high degrees, so these resultants generally contain many extraneous factors. Here we develop fast algorithms to implicitize rational tensor product surfaces by computing the resultant of three moving planes corresponding to three syzygies with low degrees. These syzygies are easy to compute, and the resultants of the corresponding moving planes generally contain fewer extraneous factors than the resultants of the moving planes corresponding to \u03bc-bases. We predict and compute all the possible extraneous factors that may appear in these resultants. Examples are provided to clarify and illuminate the theory.<\/jats:p>","DOI":"10.1145\/3119909","type":"journal-article","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T11:49:04Z","timestamp":1503575344000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Implicitizing Rational Tensor Product Surfaces Using the Resultant of Three Moving Planes"],"prefix":"10.1145","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5769-4814","authenticated-orcid":false,"given":"Li-Yong","family":"Shen","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, University of Chinese Academy of Sciences"}]},{"given":"Ron","family":"Goldman","sequence":"additional","affiliation":[{"name":"Computer Science Department, Rice University, Houston, Texas, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,8,24]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2004.09.007"},{"key":"e_1_2_2_2_1","volume-title":"Groebner-bases: An algorithmic method in polynomial ideal theory. In Multidimensional Systems Theory\u2014Progress, Directions and Open Problems in Multidimensional Systems","author":"Buchberger B.","year":"1985","unstructured":"B. Buchberger . 1985 . Groebner-bases: An algorithmic method in polynomial ideal theory. In Multidimensional Systems Theory\u2014Progress, Directions and Open Problems in Multidimensional Systems , N. K. Bose (Ed.). Reidel Publishing Company , Dordrecht, Chapter 6, 184--232. ( Second edition: N. K. Bose (Ed.), Multidimensional Systems Theory and Application, Kluwer Academic Publisher, 2003, pp. 89--128). B. Buchberger. 1985. Groebner-bases: An algorithmic method in polynomial ideal theory. In Multidimensional Systems Theory\u2014Progress, Directions and Open Problems in Multidimensional Systems, N. K. Bose (Ed.). Reidel Publishing Company, Dordrecht, Chapter 6, 184--232. (Second edition: N. K. Bose (Ed.), Multidimensional Systems Theory and Application, Kluwer Academic Publisher, 2003, pp. 89--128)."},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2013.08.014"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-09-09550-1"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219498803000489"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.01.003"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1077-3169(02)00017-5"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8396(01)00012-7"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2001.0462"},{"key":"e_1_2_2_10_1","volume-title":"Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering","author":"Cox David A.","unstructured":"David A. Cox . 2001. Equations of parametric curves and surfaces via syzygies . In Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering , Vol. 286 . AMS, Providence, RI , Contemporary Mathematics , 1--20. DOI:http:\/\/dx.doi.org\/10.1090\/conm\/286\/0475 10.1090\/conm David A. Cox. 2001. Equations of parametric curves and surfaces via syzygies. In Symbolic Computation: Solving Equations in Algebra, Geometry, and Engineering, Vol. 286. AMS, Providence, RI, Contemporary Mathematics, 1--20. DOI:http:\/\/dx.doi.org\/10.1090\/conm\/286\/0475"},{"key":"e_1_2_2_11_1","volume-title":"Algebraic Geometry and Geometric Modeling","volume":"334","author":"Cox David A.","year":"2004","unstructured":"David A. Cox . 2004 . Curves, surfaces and syzygies . In Algebraic Geometry and Geometric Modeling , Vol. 334 . AMS, Providence, RI, Contemporary Mathematics, 131--150. DOI:http:\/\/dx.doi.org\/10.1090\/conm\/334 10.1090\/conm David A. Cox. 2004. Curves, surfaces and syzygies. In Algebraic Geometry and Geometric Modeling, Vol. 334. AMS, Providence, RI, Contemporary Mathematics, 131--150. DOI:http:\/\/dx.doi.org\/10.1090\/conm\/334"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6911-1"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16721-3"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-02-02910-0"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05148-1_5"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073904"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(03)00086-5"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/067\/11"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2011.12.010"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4771-1"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/120694.120706"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8396(92)90051-P"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218460"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2016.07.001"},{"key":"e_1_2_2_25_1","volume-title":"Algorithms for computing strong &mu;-bases for rational tensor product surfaces. Computer Aided Geometric Design 52--53","author":"Shen Li-Yong","year":"2017","unstructured":"Li-Yong Shen and Ron Goldman . 2017a. Algorithms for computing strong &mu;-bases for rational tensor product surfaces. Computer Aided Geometric Design 52--53 ( 2017 ), 48--62. DOI:http:\/\/dx.doi.org\/https:\/\/doi.org\/10.1016\/j.cagd.2017.03.001. Geometric Modeling and Processing 2017. 10.1016\/j.cagd.2017.03.001 Li-Yong Shen and Ron Goldman. 2017a. Algorithms for computing strong &mu;-bases for rational tensor product surfaces. Computer Aided Geometric Design 52--53 (2017), 48--62. DOI:http:\/\/dx.doi.org\/https:\/\/doi.org\/10.1016\/j.cagd.2017.03.001. Geometric Modeling and Processing 2017."},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1091952"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-010-7218-6"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2012.09.005"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.026"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/334"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3119909","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3119909","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:04Z","timestamp":1750273504000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3119909"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,24]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3119909"],"URL":"https:\/\/doi.org\/10.1145\/3119909","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,24]]},"assertion":[{"value":"2016-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-08-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}