Estimating the number of tetrahedra determined by volume, circumradius and four face areas using Groebner basis

DOI10.1016/j.jsc.2016.02.002zbMath1405.51013OpenAlexW2307111655MaRDI QIDQ277227

Ya-Lun Tsai

Publication date: 4 May 2016

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.02.002

zbMATH Keywords

polynomial systemGroebner basistetrahedraHermite quadratic form

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Length, area and volume in real or complex geometry (51M25)

Related Items

The Number of Gröbner Bases in Finite Fields (Research), Small Gröbner fans of ideals of points, The number of tetrahedra sharing the same metric invariants via symbolic and numerical computations

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some tapas of computer algebra
• Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
• Distance Geometry
• Metric invariants of tetrahedra via polynomial elimination
• An open problem on metric invariants of tetrahedra
• Computer Algebra in Scientific Computing