{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:33:39Z","timestamp":1762781619544},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T00:00:00Z","timestamp":1285286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s11786-010-0046-1","type":"journal-article","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T05:43:41Z","timestamp":1285220621000},"page":"25-44","source":"Crossref","is-referenced-by-count":6,"title":["Computing the Newton Polygon of the Implicit Equation"],"prefix":"10.1007","volume":"4","author":[{"given":"Ioannis Z.","family":"Emiris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Konaxis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,24]]},"reference":[{"key":"46_CR1","unstructured":"Corless, R.M., Giesbrecht, M.W., Kotsireas, I.S., Watt, S.M.: Numerical implicitization of parametric hypersurfaces with linear algebra. In: Artificial Intelligence & symbolic Computation, (Madrid, 2000), pp. 174\u2013183. Springer, Berlin (2001)"},{"issue":"8","key":"46_CR2","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/S0167-8396(98)00014-4","volume":"15","author":"D.A. Cox","year":"1998","unstructured":"Cox D.A., Sederberg T.W., Chen F.: The moving line ideal basis of planar rational curves. Comput. Aided Geom. Des. 15(8), 803\u2013827 (1998)","journal-title":"Comput. Aided Geom. Des."},{"issue":"4","key":"46_CR3","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1090\/S0894-0347-07-00562-0","volume":"20","author":"A. Dickenstein","year":"2007","unstructured":"Dickenstein A., Feichtner E.M., Sturmfels B.: Tropical discriminants. J. Am. Math. Soc. 20(4), 1111\u20131133 (2007)","journal-title":"J. Am. Math. Soc."},{"key":"46_CR4","unstructured":"Dokken, T.: Approximate implicitization. In: Mathematical Methods for Curves and Surfaces (Oslo, 2000), pp. 81\u2013102. Vanderbilt University, Nashville (2001)"},{"key":"46_CR5","volume-title":"Math. in Comp. Science (this Issue)","author":"C. D\u2019Andrea","year":"2010","unstructured":"D\u2019Andrea C., Sombra M.: The Newton polygon of a rational plane curve. In: Gonzalez-Vega, L., Lazard, S. (eds) Math. in Comp. Science (this Issue), Birkh\u00e4user, Basel (2010)"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-1-4419-0999-2_2","volume-title":"Nonlinear Computational Geometry. IMA Volumes in Math. & Appl., vol. 151","author":"C. D\u2019Andrea","year":"2009","unstructured":"D\u2019Andrea C., Sombra M.: Rational parametrizations, intersection theory and Newton polytopes. In: Emiris, I.Z., Sottile, F., Theobald, T. (eds) Nonlinear Computational Geometry. IMA Volumes in Math. & Appl., vol. 151, pp. 35\u201350. Springer, New York (2009)"},{"key":"46_CR7","unstructured":"Emiris, I.Z., Fisikopoulos, V., Konaxis, C.: Regular triangulations and resultant polytopes. 26th Europ. Workshop Comput. Geometry, Dortmund, Germany (2010)"},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Kotsireas, I.S.: Implicitization with polynomial support optimized for sparseness. In: Proc. Intern. Conf. Comput. Science & Appl. 2003, Montreal (Intern. Workshop Comp. Graphics & Geom. Modeling). LNCS, vol. 2669, pp. 397\u2013406. Springer, Berlin (2003)","DOI":"10.1007\/3-540-44842-X_41"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Emiris, I.Z., Kotsireas, I.S.: Implicitization exploiting sparseness. In: Janardan, R., Smid, M., Dutta, D. (eds.) Geometric & Algorithmic Aspects of Comp.-Aided Design & Manufacturing. DIMACS, vol. 67, pp. 281\u2013298. DIMACS (2005)","DOI":"10.1090\/dimacs\/067\/11"},{"key":"46_CR10","unstructured":"Emiris, I.Z., Konaxis, C., Palios, L.: Computing the Newton polytope of specialized resultants. MEGA 2007, RICAM (Johann Radon Institute for Computational and Applied Mathematics), Strobl, Austria"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Esterov, A., Khovanskii, A.: Elimination theory and Newton polytopes (2007). arXiv.org:math\/0611107v2","DOI":"10.1007\/s11853-008-0015-2"},{"key":"46_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0001-8708(90)90047-Q","volume":"84","author":"I.M. Gelfand","year":"1990","unstructured":"Gelfand I.M., Kapranov M.M., Zelevinsky A.V.: Newton polytopes of the classical resultant and discriminant. Adv. Math. 84, 237\u2013254 (1990)","journal-title":"Adv. Math."},{"key":"46_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4771-1","volume-title":"Discriminants, Resultants and Multidimensional Determinants","author":"I. Gelfand","year":"1994","unstructured":"Gelfand I., Kapranov M., Zelevinsky A.: Discriminants, Resultants and Multidimensional Determinants. Birkh\u00e4user, Boston (1994)"},{"issue":"4","key":"46_CR14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/PL00009439","volume":"21","author":"T. Michiels","year":"1999","unstructured":"Michiels T., Verschelde J.: Enumerating regular mixed-cell configurations. Discret. Comp. Geom. 21(4), 569\u2013579 (1999)","journal-title":"Discret. Comp. Geom."},{"key":"46_CR15","unstructured":"Philippon, P., Sombra, M.: A refinement of the Kusnirenko\u2013Bernstein estimate. Tech. Report (2007). arXiv.org:0709.3306"},{"key":"46_CR16","doi-asserted-by":"crossref","unstructured":"Santos, F.: The Cayley trick and triangulations of products of simplices. In: Integer Points in Polyhedra: Geometry, Number Theory, Algebra, Optimization. Contemporary Mathematics, vol. 374, pp. 151\u2013177. AMS, Philadelphia (2005)","DOI":"10.1090\/conm\/374\/06904"},{"issue":"1","key":"46_CR17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-8396(86)90025-7","volume":"3","author":"T.W. Sederberg","year":"1986","unstructured":"Sederberg T.W.: Improperly parametrized rational curves. Comput. Aided Geom. Des. 3(1), 67\u201375 (1986)","journal-title":"Comput. Aided Geom. Des."},{"key":"46_CR18","doi-asserted-by":"crossref","unstructured":"Sendra, J.R., Winkler, F.: Computation of the degree of rational maps between curves. In: Proc. Intern. Symp. Symbolic & Algebraic Computation, pp. 317\u2013322. ACM Press, New York (2001)","DOI":"10.1145\/384101.384144"},{"issue":"2","key":"46_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1022497624378","volume":"3","author":"B. Sturmfels","year":"1994","unstructured":"Sturmfels B.: On the Newton polytope of the resultant. J. Algebraic Comb. 3(2), 207\u2013236 (1994)","journal-title":"J. Algebraic Comb."},{"key":"46_CR20","doi-asserted-by":"crossref","unstructured":"Sturmfels, B., Tevelev, J., Yu, J.: The Newton polytope of the implicit equation. Moscow Math. J. 7(2) (2007)","DOI":"10.17323\/1609-4514-2007-7-2-327-346"},{"key":"46_CR21","first-page":"317","volume-title":"Zero-Dimensional Schemes Proc Ravello, June 1992","author":"B. Sturmfels","year":"1994","unstructured":"Sturmfels B., Yu J.T.: Minimal polynomials and sparse resultants. In: Orecchia, F., Chiantini, L. (eds) Zero-Dimensional Schemes Proc Ravello, June 1992, pp. 317\u2013324. De Gruyter, Berlin (1994)"},{"key":"46_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-0-387-78133-4_7","volume-title":"Software for Algebraic Geometry. IMA Volumes in Math. & its Appl., vol 148","author":"B. Sturmfels","year":"2008","unstructured":"Sturmfels B., Yu J.: Tropical implicitization and mixed fiber polytopes. In: Stillman, M., Verschelde, J., Takayama, N. (eds) Software for Algebraic Geometry. IMA Volumes in Math. & its Appl., vol 148, pp. 111\u2013131. Springer, New York (2008)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-010-0046-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-010-0046-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-010-0046-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T21:11:29Z","timestamp":1559682689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-010-0046-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,24]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s11786-010-0046-1","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,24]]}}}