Empty pseudo-triangles in point sets (Q765318): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59782298, #quickstatements; #temporary_batch_1711015421434
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Convexity minimizes pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions, partitions, and coverings with convex polygons and pseudo-triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of pseudo-triangulations of certain point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Empty Simplices in Euclidean Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar point sets with a small number of empty convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest empty rectangle among a point set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar sets with few empty convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping an arrangement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum weight pseudo-triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sets with No Empty Convex 7-Gons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topologically sweeping visibility complexes via pseudotriangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE VISIBILITY COMPLEX / 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: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / rank
 
Normal rank

Latest revision as of 00:49, 5 July 2024

scientific article
Language Label Description Also known as
English
Empty pseudo-triangles in point sets
scientific article

    Statements

    Empty pseudo-triangles in point sets (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 March 2012
    0 references
    finite planar point set
    0 references
    pseudo-triangle count
    0 references
    optimal pseudo-triangle computation
    0 references

    Identifiers

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