Minkowski decomposition and geometric predicates in sparse implicitization

DOI10.1145/2755996.2756661MaRDI QIDQ2819753zbMATH OpenOpenAlexWikidataFDO

Authors Ioannis Z. Emiris, Christos Konaxis, Zafeirakis Zafeirakopoulos

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

interpolationinteger linear programmingmatrix representationNewton polytopeMinkowski decompositionmembershipsidednesssparse implicitization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5130863
• Implicitization of curves and surfaces using predicted support
• Sparse implicitization via interpolation
• Implicitization of curves and (hyper)surfaces using predicted support
• Implicit representations of high-codimension varieties

Cited in

(2)

• On the descriptor variable observation of rectangular implicit representations, in the presence of column minimal indices blocks
• Implicitization of hypersurfaces

Describes a project that uses

Uses Software

• SageMath
• Maple

This page was built for publication: Minkowski decomposition and geometric predicates in sparse implicitization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2819753)