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

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00071-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037540484 / rank
 
Normal rank

Latest revision as of 09:07, 30 July 2024

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

    Statements

    Identifiers