An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing (Q946479): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00607-007-0249-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084533748 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete Laplace-Beltrami operator for simplicial surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams on piecewise flat surfaces and an application to biological growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Riemann surfaces and the Ising model. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Discrete Minimal Surfaces and Their Conjugates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4251963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal roughness property of the Delaunay triangulation / rank
 
Normal rank

Latest revision as of 16:35, 28 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing
scientific article

    Statements

    An algorithm for the construction of intrinsic Delaunay triangulations with applications to digital geometry processing (English)
    0 references
    0 references
    0 references
    23 September 2008
    0 references
    numerical examples
    0 references
    graphical examples
    0 references
    computational geometry
    0 references

    Identifiers