Minkowski Decomposition and Geometric Predicates in Sparse Implicitization

DOI10.1145/2755996.2756661zbMath1347.65042OpenAlexW2046520681WikidataQ57908668 ScholiaQ57908668MaRDI QIDQ2819753

Zafeirakis Zafeirakopoulos, Christos Konaxis, Ioannis Z. Emiris

Publication date: 29 September 2016

Published in: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2755996.2756661

zbMATH Keywords

interpolationNewton polytopematrix representationinteger linear programmingMinkowski decompositionmembershipsidednesssparse implicitization

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Integer programming (90C10) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (1)

Implicitization of hypersurfaces

Uses Software

• Maple
• SageMath

This page was built for publication: Minkowski Decomposition and Geometric Predicates in Sparse Implicitization