Triangulation automatique d’un polyèdre en dimension $N$ (Q3683492): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2282797220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Angle Condition in the Finite Element Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3857361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Voronoi polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic triangulation of arbitrary planar domains for the finite element method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering space with equal spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4760292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Convex Hull Algorithm for Planar Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Dirichlet Tessellations in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Voronoi Diagrams in the <i> L <sub>p</sub> </i> -Metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer cartography point-in-polygon programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A brief review of techniques for generating irregular computational grids / rank
 
Normal rank

Revision as of 17:05, 14 June 2024

scientific article
Language Label Description Also known as
English
Triangulation automatique d’un polyèdre en dimension $N$
scientific article

    Statements

    Triangulation automatique d’un polyèdre en dimension $N$ (English)
    0 references
    1982
    0 references
    polyhedra
    0 references
    automatic triangulation
    0 references
    simplicial partition
    0 references
    Voronoi diagram
    0 references
    Delaunay triangulation
    0 references
    convex hull
    0 references
    volume computation
    0 references
    FORTRAN program
    0 references
    finite element method
    0 references

    Identifiers

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