Faithful Real-Time Animation of Parametrized (Semi-) Algebraic Expressions via Cylindrical Algebraic Decomposition
Pages 43 - 46
Abstract
We present some current improvements, implemented in the software package GeoGebra Discovery, that combine symbolic computation and graphics algorithms to faithfully visualize (semi-)algebraic expressions. Our implementation allows fluid animation of set of (semi-)algebraic sets of dimension 1 in a desktop application or a web browser. We use the Tarski library to create a cylindrical algebraic decomposition of the input, and its plot2d command, which is processed further in GeoGebra Discovery, to provide the user with a familiar look and feel.
References
[1]
J. G. Alcazar, J. Caravantes, G. M. Diaz-Toca, and E. Tsigaridas. Computing the topology of a plane or space hyperelliptic curve. Computer Aided Geometric Design, 78:101830, 2020.
[2]
M. E. Alonso and M. Raimondo. The computation of the topology of a planar semi-algebraic set. Rend. Sem. Mat. Univers. Politecn. Torino, 46:327--342, 1989.
[3]
D. S. Arnon, G. E. Collins, and S. McCallum. Cylindrical algebraic decomposition II: An adjacency algorithm for the plane. SIAM Journal on Computing, 13(4):878--889, 1984.
[4]
D. S. Arnon and S. McCallum. A polynomial-time algorithm for the topological type of a real algebraic curve. Journal of Symbolic Computation, 5(1):213--236, 1988.
[5]
P. Birklbauer and D. Drakulić. Implicit curves in GeoGebra 4. The Second GeoGebra Conference, Hagenberg - Austria, August 28--30 2011.
[6]
C. W. Brown. Constructing cylindrical algebraic decompositions of the plane quickly, 2002. https://www.usna.edu/Users/cs/wcbrown/research/MOTS2002.1.pdf.
[7]
X. S. Gao. Automated geometry diagram construction and engineering geometry. In ADG 1998, volume 1669 of Lecture Notes in Computer Science, pages 232--257. Springer, Heidelberg, 1999.
[8]
M. Hohenwarter, M. Borcherds, G. Ancsin, B. Bencze, M. Blossier, A. Delobelle, C. Denizet, J. Éliás, A. Fekete, L. Gál, Z. Konečný, Z. Kovács, S. Lizelfelner, B. Parisse, and G. Sturr. GeoGebra 5, Sept. 2014. http://www.geogebra.org.
[9]
K. Jin and J. Cheng. Isotopic meshing of a real algebraic space curve. Journal of Systems Science and Complexity, 33:1275--1296, 2020.
[10]
Z. Kovács. Real-time animated dynamic geometry in the classrooms by using fast Gröbner basis computations. Mathematics in Computer Science, 11(3--4):351--361, 3 2017.
[11]
Z. Kovács, C. W. Brown, T. Recio, and R. Vajda. A web version of Tarski, a system for computing with Tarski formulas and semialgebraic sets. In B. Buchberger, M. Marin, V. Negru, and D. Zaharie, editors, Proceedings of the 2022 24th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pages 59--62. IEEE Computer Society Conference Publishing Services, 9 2022.
[12]
Z. Kovács, T. Recio, and M. P. Vélez. Reasoning about linkages with dynamic geometry. Journal of Symbolic Computation, 97:16--30, 2020.
[13]
Z. Kovács, T. Recio, and M. P. Vélez. Automated reasoning tools in GeoGebra Discovery. ACM Communications in Computer Algebra, 55(2):39--43, 6 2021.
[14]
F. Vale-Enriquez and C. W. Brown. Polynomial constraints and unsat cores in Tarski. In J. H. Davenport, M. Kauers, G. Labahn, and J. Urban, editors, Mathematical Software - ICMS 2018, volume 10931 of Lecture Notes in Computer Science, pages 466--474. Springer, Cham, 2018.
Recommendations
Representations of Algebraic Domains and Algebraic L-domains by Information Systems
Information systems play an important role in characterizing order structures. In this paper, we introduce the notions of the algebraic information system and algebraic L-information system. They are of the same logic-oriented style as the information ...
Algebraic structures on double and plane posets
We study the Hopf algebra of double posets and two of its Hopf subalgebras, the Hopf algebras of plane posets and of posets "without N". We prove that they are free, cofree, self-dual, and we give an explicit Hopf pairing on these Hopf algebras. We also ...
Algebraic Functions
Let A be an algebra. We say that the functions f 1, . . . , f m : A n A are algebraic on A provided there is a finite system of term-equalities $${{\bigwedge t_{k}(\overline{x}, \overline{z}) = s_{k}(\overline{x}, \overline{z})}}$$ satisfying that for each $${{\overline{a} \in A^{n}}}$$ , the m -tuple $${{(f_{1}(\overline{a}), \ldots , f_{m}(\overline{a}))}}$$ is the unique solution in A m to the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2023 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 August 2023
Published in SIGSAM-CCA Volume 57, Issue 2
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 27Total Downloads
- Downloads (Last 12 months)13
- Downloads (Last 6 weeks)0
Reflects downloads up to 31 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in