A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics

Michael Hemmer, Laurent Dupont, Sylvain Petitjean, Elmar Schömer. A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics. Journal of Symbolic Computation, 46(4):467-494, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.