Q5075759 (Q5075759): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CGAL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surface reconstruction by Voronoi filtering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental constructions con BRIO / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the delaunay triangulation of points on surfaces the smooth case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth surface reconstruction via natural neighbour interpolation of distance functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental construction of the delaunay triangulation and the delaunay graph in medium dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the randomized construction of the Delaunay tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of random sampling in computational geometry. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOMIZATION YIELDS SIMPLE O(n <font>log</font><sup>⋆</sup> n) ALGORITHMS FOR DIFFICULT Ω(n) PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE DELAUNAY HIERARCHY / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected number of \(k\)-faces of a Voronoi diagram / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-dimensional Voronoi diagrams in linear expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nice point sets can have nasty Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense point sets have sparse Delaunay triangulations or ``\dots but not too nasty'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the average complexity of 3D-Voronoi diagrams of random points on convex polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5824629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random tessellations in ℝ<sup><i>d</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134498 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:47, 28 July 2024

scientific article; zbMATH DE number 7525459
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7525459

    Statements

    0 references
    0 references
    0 references
    0 references
    11 May 2022
    0 references
    randomized incremental construction
    0 references
    Delaunay triangulations
    0 references
    Voronoi diagrams
    0 references
    polyhedral surfaces
    0 references
    probabilistic analysis
    0 references

    Identifiers