Your search returned the following 3 documents:

3. A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
   Michael Hemmer, Laurent Dupon, Sylvain Petitjean, and Elmar Schomer
   Journal of Symbolic Computation 46 (4): 467-494, 2011
   
2. Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
   Laurent Dupont, Michael Hemmer, Sylvain Petitjean, and Elmar Schömer
   In: 15th Annual European Symposium on Algorithms, Eilat, Israel, 2007, 633-644
   [PDF: Download: final.pdf]
   
1. Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangment of Quadrics
   Michael Hemmer, Laurent Dupont, Sylvain Petitjean, and Elmar Schömer
   University of Groningen, 9700 AB Groningen THE NETHERLANDS, ACS-TR-241402-01, Technical Report