A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:19, 30 January 2024
scientific article
| 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 |
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
