Solving a problem with GeoGebra current possibilities and limits of CAS tools

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12410%2F25%3A43909658" target="_blank" >RIV/60076658:12410/25:43909658 - isvavai.cz</a>

Výsledek na webu

<a href="https://link.springer.com/article/10.1007/s10817-025-09733-w" target="_blank" >https://link.springer.com/article/10.1007/s10817-025-09733-w</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s10817-025-09733-w" target="_blank" >10.1007/s10817-025-09733-w</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Solving a problem with GeoGebra current possibilities and limits of CAS tools

Popis výsledku v původním jazyce

In the article we show what a Dynamic Geometry Environment (DGE) and Computer Algebra System (CAS) software is capable of exploring, computing and proving a geometry problem that is closely related to the well-known Wallace-Simson theorem. In our case, this problem turns out to be quite difficult for some software tools incorporated in the DGE software. The computation of a searched locus by the software works well in our case, but the problem must be formulated in a specific way. In addition to the conclusions attained by DGE software, we present computer-aided analytical solutions in the second half of paper. It is shown that the use of non-degeneracy conditions before elimination leads to a significant reduction of the computation time.

Název v anglickém jazyce

Solving a problem with GeoGebra current possibilities and limits of CAS tools

Popis výsledku anglicky

In the article we show what a Dynamic Geometry Environment (DGE) and Computer Algebra System (CAS) software is capable of exploring, computing and proving a geometry problem that is closely related to the well-known Wallace-Simson theorem. In our case, this problem turns out to be quite difficult for some software tools incorporated in the DGE software. The computation of a searched locus by the software works well in our case, but the problem must be formulated in a specific way. In addition to the conclusions attained by DGE software, we present computer-aided analytical solutions in the second half of paper. It is shown that the use of non-degeneracy conditions before elimination leads to a significant reduction of the computation time.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

JOURNAL OF AUTOMATED REASONING

ISSN

0168-7433

e-ISSN

1573-0670

Svazek periodika

69

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

13

Strana od-do

nestránkováno

Kód UT WoS článku

001531200100001

EID výsledku v databázi Scopus

2-s2.0-105011047151