A Complete, Exact and Efficient Implementation for Computing the Edge-adjacency 
Graph of an Arrangement of Quadrics

Hemmer, Michael; Dupon, Laurent; Petitjean, Sylvain; Schomer, Elmar

doi:10.1016/j.jsc.2010.11.002

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Complete, Exact and Efficient Implementation for Computing the Edge-adjacency Graph of an Arrangement of Quadrics

MPS-Authors

/persons/resource/persons44609

Hemmer, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45414

Schomer, Elmar
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Hemmer, M., Dupon, L., Petitjean, S., & Schomer, E. (2011). 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. doi:10.1016/j.jsc.2010.11.002.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-11D6-F

Abstract

There is no abstract available