On the number of pseudo-triangulations of certain point sets (Q2474495): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59782361, #quickstatements; #temporary_batch_1706897434465
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Oswin Aichholzer / rank
Normal rank
 
Property / author
 
Property / author: Oswin Aichholzer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OEIS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103342896 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0601747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity minimizes pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudotriangulations from Surfaces and a Novel Type of Edge Flip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the number of triangulations of planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ray shooting in polygons using geodesic triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating a class of lattice paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motzkin numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singularity Analysis of Generating Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the number of crossing-free subgraphs of \(K_N\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar minimally rigid graphs and pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polytope of non-crossing graphs on a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal tangent visibility graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping visibility complexes via pseudotriangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better upper bound on the number of triangulations of a planar point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocating vertex \(\pi\)-guards in simple polygons via pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4236280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acute triangulations of polygons / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:28, 27 June 2024

scientific article
Language Label Description Also known as
English
On the number of pseudo-triangulations of certain point sets
scientific article

    Statements

    On the number of pseudo-triangulations of certain point sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    6 March 2008
    0 references
    pseudo-triangulations
    0 references
    triangulations
    0 references
    double-circle
    0 references
    double-chain
    0 references
    counting
    0 references

    Identifiers