Locus Computation in Dynamic Geometry Environment

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60076658%3A12410%2F19%3A43900228" target="_blank" >RIV/60076658:12410/19:43900228 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/60076658:12410/18:43898279

Výsledek na webu

<a href="https://www.researchgate.net/publication/326154957_Locus_Computation_in_Dynamic_Geometry_Environment" target="_blank" >https://www.researchgate.net/publication/326154957_Locus_Computation_in_Dynamic_Geometry_Environment</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Locus Computation in Dynamic Geometry Environment

Popis výsledku v původním jazyce

The article is focused on investigation of geometric loci by current dynamic geometry software. On a few problems we illustrate ability of actual software to determine an unknown locus and its equation in terms of given properties using GeoGebra commands Locus and LocusEquation. After the use of these commands we present how computer arrives at the searched locus and how to analyze the cases when we get some extra components apart from the locus, either due to degenerate instances of the construction or due to Zariski closure of an algebraic set. We also demonstrate the ways how to attain new results by experiments, which would be hardly accessible without computers.

Název v anglickém jazyce

Locus Computation in Dynamic Geometry Environment

Popis výsledku anglicky

The article is focused on investigation of geometric loci by current dynamic geometry software. On a few problems we illustrate ability of actual software to determine an unknown locus and its equation in terms of given properties using GeoGebra commands Locus and LocusEquation. After the use of these commands we present how computer arrives at the searched locus and how to analyze the cases when we get some extra components apart from the locus, either due to degenerate instances of the construction or due to Zariski closure of an algebraic set. We also demonstrate the ways how to attain new results by experiments, which would be hardly accessible without computers.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

50302 - Education, special (to gifted persons, those with learning disabilities)

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2019

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

Mathematics in Computer Science

ISSN

1661-8270

e-ISSN

—

Svazek periodika

13

Číslo periodika v rámci svazku

1-2

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

10

Strana od-do

31-40

Kód UT WoS článku

000474596200005

EID výsledku v databázi Scopus

999