ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS (Q4818572): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Constructions and complexity of secondary polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases and triangulations of the second hypersimplex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gröbner bases of toric varieties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-Dimensional Triangulations from Local Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of three-dimensional Delaunay triangulations using local transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental topological flipping works for regular triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonregular triangulations of products of simplices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorph-Free Exhaustive Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of faces of a simplicial convex polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal simplicial dissections and triangulations of convex 3-polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Properties for Dissections of Convex 3-Polytopes / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195902000980 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164401760 / rank
 
Normal rank

Latest revision as of 11:02, 30 July 2024

scientific article; zbMATH DE number 2104273
Language Label Description Also known as
English
ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
scientific article; zbMATH DE number 2104273

    Statements

    ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 September 2004
    0 references
    enumeration
    0 references
    regular triangulation
    0 references
    dissection
    0 references
    secondary polytope
    0 references
    reverse search
    0 references
    independent set
    0 references

    Identifiers

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