Papers
Topics
Authors
Recent
Search
2000 character limit reached

Groebner bases in Java with applications in computer graphics

Published 19 May 2010 in cs.MS, cs.GR, math.MG, and math.RA | (1005.3992v2)

Abstract: In this paper we present a Java implementation of the algorithm that computes Buchbereger's and reduced Groebner's basis step by step. The Java application enables graphical representation of the intersection of two surfaces in 3-dimensional space and determines conditions of existence and planarity of the intersection.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.