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]
@article{HemmerDPS11,
title = {A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics},
author = {Michael Hemmer and Laurent Dupont and Sylvain Petitjean and Elmar Schömer},
year = {2011},
doi = {10.1016/j.jsc.2010.11.002},
url = {http://dx.doi.org/10.1016/j.jsc.2010.11.002},
tags = {completeness, graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/HemmerDPS11},
cites = {0},
citedby = {0},
journal = {Journal of Symbolic Computation},
volume = {46},
number = {4},
pages = {467-494},
}