Simplification of surface parametrizations --a lattice polygon approach (Q1878488): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: H. P. Dikshit / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: H. P. Dikshit / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Convex Lattice Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on Adjoints and Arithmetic Genera of Algebraic Varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pluricanonical Cohomology Across Flips / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convex layers of a planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3483936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational parametrization of surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree bound for the parametrization of a rational surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On convex lattice polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5623828 / rank
 
Normal rank

Latest revision as of 19:22, 6 June 2024

scientific article
Language Label Description Also known as
English
Simplification of surface parametrizations --a lattice polygon approach
scientific article

    Statements

    Simplification of surface parametrizations --a lattice polygon approach (English)
    0 references
    0 references
    20 August 2004
    0 references
    In an earlier paper of the author [Proc. ISSAC 2002, ACM Press, New York, pp. 229--237 (2002)], an algorithm was given that produces a reparametrization which is at most twice as large as the smallest possible reparametrization. In the present paper, the author specializes, the algorithm to the case of toric surfaces and describes it for this case by operations on lattice polygons.
    0 references
    parametric surface
    0 references
    reparametrization
    0 references
    toric surface
    0 references
    0 references

    Identifiers