A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics |
scientific article; zbMATH DE number 5862852
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics |
scientific article; zbMATH DE number 5862852 |
Statements
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (English)
0 references
9 March 2011
0 references
arrangement
0 references
intersection of surfaces
0 references
quadrics
0 references
pencils of quadrics
0 references
curve parameterization
0 references
algorithm
0 references
numerical examples
0 references
0 references
0 references
0 references
0.98289275
0 references
0.88822424
0 references
0.8725253
0 references
0 references
0.86206317
0 references
0.86064565
0 references
0.8556051
0 references
