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]

Authors

Michael Hemmer

This author has not been identified. Look up 'Michael Hemmer' in Google

Laurent Dupont

This author has not been identified. Look up 'Laurent Dupont' in Google

Sylvain Petitjean

This author has not been identified. Look up 'Sylvain Petitjean' in Google

Elmar Schömer

This author has not been identified. Look up 'Elmar Schömer' in Google