A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jsc.2010.11.002 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2171198234 / rank | |||
Normal rank |
Revision as of 20:52, 19 March 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