2014
DOI: 10.1007/s10472-014-9438-2
|View full text |Cite
|
Sign up to set email alerts
|

A Singular web service for geometric computations

Abstract: Outsourcing algebraic computations in dynamic geometry is a possible strategy used when software distribution constraints apply. Either if the target user machine has hardware limitations, or if the computer algebra system cannot be easily (or legally) packaged inside the geometric software, this approach can solve current shortcomings in dynamic environments. We report the design and implementation of a web service using Singular, a program specialized in ideal theory and commutative algebra. Besides its cano… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 8 publications
(13 citation statements)
references
References 12 publications
0
13
0
Order By: Relevance
“…In order to simplify the costly elimination process, we realize that IIdeal contains a polynomial d 1 > EliminationIdeal(IdealA,{t1,t2,t3,t4});EliminationIdeal(IdealB, {t1,t2,t3,t4}); <0> <t2> > EliminationIdeal (IIdeal, {t1,t2,t3,t4}); <0>…”
Section: Converse Varignon: Option B) Proving It Is Not Generally Famentioning
confidence: 99%
See 2 more Smart Citations
“…In order to simplify the costly elimination process, we realize that IIdeal contains a polynomial d 1 > EliminationIdeal(IdealA,{t1,t2,t3,t4});EliminationIdeal(IdealB, {t1,t2,t3,t4}); <0> <t2> > EliminationIdeal (IIdeal, {t1,t2,t3,t4}); <0>…”
Section: Converse Varignon: Option B) Proving It Is Not Generally Famentioning
confidence: 99%
“…and the like) from a given list of relation questions, that are also automatically translated by the program into algebraic terms. Then, following different criteria, constraints and heuristics, a collection of algebraic methods in ADG, some of them using the own GeoGebra symbolic computation features, some others connecting with an external server (see, for instance, [1]) are activated and sequentially attempt dealing with the proposed question, until one of them eventually succeeds or the program yields a failure warning. In the successful case, the output is a grant/denial of the truth of the proposed statement, eventually including a list of non-degeneracy conditions for the validity of the proposition.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…GSP, although not having a specific command to deal with envelopes, gives some related advice about constructing envelopes. 5 There, the statement a geometric envelope can be thought of as the limit or edge of the locus of a line or a circle is succesfully An approximate envelope computed through definition E 3 in GeoGebra applied to find some envelopes. This protocol catches the concept behind definition E 3 , and it is a natural way to get the envelopes as curves.…”
Section: Envelopes As Limit Of Intersections Of Nearby Curvesmentioning
confidence: 99%
“…Finally, the last part of Sections 3 and 4 address the second objective of this note, namely, to describe the basic issues behind a new command for envelope computation, featured in the new 5.0 version of GeoGebra (September 2014) and based on a series of recent contributions by the authors of this note and their collaborators [5][6][7][8][9][10][11]. The idea here is to present just a sketchy picture on how some key ingredients from effective algebraic geometry are put together to conform the algorithmic approach behind this GeoGebra command.…”
Section: Introductionmentioning
confidence: 99%