A data modeling abstraction for describing triangular mesh algorithms (Q678220): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3323187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting adjacency relationships from a modular boundary model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of triangular grid: I—subdivision of a general polygon into convex subregions. II—triangulation of convex polygons / 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: A storage-efficient method for construction of a Thiessen triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constrained Two-Dimensional Triangulation and the Solution of Closest Node Problems in the Presence of Barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for advancing front techniques of finite element mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay Triangular Meshes in Convex Polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Dimensional Triangulations from Local Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrections to Lee's visibility polygon algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3731049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for constructing a Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulation of planar regions with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Dimensional Mesh Verification Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4092988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4154035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic three-dimensional mesh generation by the modified-octree technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of an Adaptive, Parallel Finite-Element System / rank
 
Normal rank

Latest revision as of 12:10, 27 May 2024

scientific article
Language Label Description Also known as
English
A data modeling abstraction for describing triangular mesh algorithms
scientific article

    Statements

    A data modeling abstraction for describing triangular mesh algorithms (English)
    0 references
    0 references
    0 references
    0 references
    16 April 1997
    0 references
    0 references
    algorithms
    0 references
    unstructured meshes
    0 references
    planar triangular meshes
    0 references
    Delaunay triangulation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references