An optimal algorithm for realizing a Delaunay triangulation (Q287080): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the modality of convex polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating binary trees at random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte carlo estimates of the distributions of the random polygons determined by random lines in a plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computer generation of random convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizability of Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random polytopes: Their definition, generation and aggregate properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of convex polygons with individual angular constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5845761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler proof of a realizability theorem on Delaunay triangulations / rank
 
Normal rank

Revision as of 01:07, 12 July 2024

scientific article
Language Label Description Also known as
English
An optimal algorithm for realizing a Delaunay triangulation
scientific article

    Statements

    Identifiers