A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics (Q629354): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MAPC / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Quadratic interval refinement for real roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact, complete and efficient implementation for computing planar maps of quadric intersection curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact geometric-topological analysis of algebraic surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweep-plane algorithm for computing the volume of polyhedra represented in Boolean form / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Subresultant PRS Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4391215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact computation of the medial axis of a polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal parameterization of the intersection of quadrics. III. Parameterizing singular intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Algebra in Scientific Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact, efficient, and complete arrangement computation for cubic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing GCDs of polynomials over algebraic number fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design and implementation of panar maps in CGAL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of polynomial greatest common divisors over an algebraic number field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting quadrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local box adjacency algorithms for cylindrical algebraic decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of an arrangement of quadrics in 3D / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact and efficient approach for computing a cell in an arrangement of quadrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963124 / rank
 
Normal rank

Latest revision as of 21:00, 3 July 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
    0 references
    0 references
    0 references
    0 references
    9 March 2011
    0 references
    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 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references