Parallel chen-han (PCH) algorithm for discrete geodesics (Q5419165): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computing geodesic paths on manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of geodesics on triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Functions and Geodesics on Submanifolds of $\R^d$ and Point Clouds / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Discrete Geodesic Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast marching level set method for monotonically advancing fronts. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Shortest Paths in Polyhedral Spaces / rank
 
Normal rank

Latest revision as of 13:48, 8 July 2024

scientific article; zbMATH DE number 6301216
Language Label Description Also known as
English
Parallel chen-han (PCH) algorithm for discrete geodesics
scientific article; zbMATH DE number 6301216

    Statements

    Parallel chen-han (PCH) algorithm for discrete geodesics (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2014
    0 references
    discrete geodesic
    0 references
    GPU
    0 references
    parallel computation
    0 references
    window propagation
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references