Jürgen Richter-Gebert

Affiliations:
  • Technical University Munich, Germany


According to our database1, Jürgen Richter-Gebert authored at least 27 papers between 1991 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Students' coping with the self-regulatory demand of crisis-driven digitalization in university mathematics instruction: do motivational and emotional orientations make a difference?
Comput. Hum. Behav., 2021

2018
Bringing Together Dynamic Geometry Software and the Graphics Processing Unit.
CoRR, 2018

2016
CindyGL: Authoring GPU-Based Interactive Mathematical Content.
Proceedings of the Mathematical Software - ICMS 2016, 2016

CindyJS Plugins - Extending the Mathematical Visualization Framework.
Proceedings of the Mathematical Software - ICMS 2016, 2016

CindyJS - Mathematical Visualization on Modern Devices.
Proceedings of the Mathematical Software - ICMS 2016, 2016

2015
Cayley-Bacharach Formulas.
Am. Math. Mon., 2015

2010
Cancellation Patterns in Automatic Geometric Theorem Proving.
Proceedings of the Automated Deduction in Geometry - 8th International Workshop, 2010

2009
Diagrams, Tensors and Geometric Reasoning.
Discret. Comput. Geom., 2009

Hyperbolization of Euclidean Ornaments.
Electron. J. Comb., 2009

Every non-Euclidean oriented matroid admits a biquadratic final polynomial.
Comb., 2009

2008
Rotations, translations and symmetry detection for complexified curves.
Comput. Aided Geom. Des., 2008

2006
Recognition of Computationally Constructed Loci.
Proceedings of the Automated Deduction in Geometry, 2006

2004
Oriented Matroids.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Basic Properties of Convex Polytopes.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

The complexity of finding small triangulations of convex 3-polytopes.
J. Algorithms, 2004

2000
Finding Small Triangulations of Polytope Boundaries Is Hard.
Discret. Comput. Geom., 2000

Minimal Simplicial Dissections and Triangulations of Convex 3-Polytopes.
Discret. Comput. Geom., 2000

Finding minimal triangulations of convex 3-polytopes is NP-hard.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Decision Complexity in Dynamic Geometry.
Proceedings of the Automated Deduction in Geometry, Third International Workshop, 2000

1997
Extremal Properties of 0/1-Polytopes.
Discret. Comput. Geom., 1997

1995
Mechanical Theorem Proving in Projective Geometry.
Ann. Math. Artif. Intell., 1995

1993
Combinatorial Obstructions to the Lifting of Weaving Diagrams.
Discret. Comput. Geom., 1993

Oriented Matroids with Few Mutations.
Discret. Comput. Geom., 1993

Two Constructions of Oriented Matroids with Disconnected Extension Space.
Discret. Comput. Geom., 1993

Euclideaness and final polynomials.
Comb., 1993

1992
A new Sylvester-Gallai configuration representing the 13-point projective plane in <i>R</i><sup>4</sup>.
J. Comb. Theory, Ser. B, 1992

1991
On the Distribution of Order Types.
Comput. Geom., 1991


  Loading...