A faster circle-sweep Delaunay triangulation algorithm (Q427141): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.advengsoft.2011.09.003 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Voronoi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Triangle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.advengsoft.2011.09.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081458114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi diagrams from convex hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional Delaunay mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795223 / 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: A faster divide-and-conquer algorithm for constructing Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401010 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sweepline algorithm for Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained higher order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized incremental construction of Delaunay and Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives for the manipulation of general subdivisions and the computation of Voronoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating realistic terrains with higher-order Delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for constructing a Delaunay triangulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulation and the convex hull of n points in expected linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weak characterisation of the Delaunay triangulation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ADVENGSOFT.2011.09.003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:12, 9 December 2024

scientific article
Language Label Description Also known as
English
A faster circle-sweep Delaunay triangulation algorithm
scientific article

    Statements

    A faster circle-sweep Delaunay triangulation algorithm (English)
    0 references
    13 June 2012
    0 references
    computational geometry
    0 references
    Delaunay triangulation
    0 references
    in-circle test
    0 references
    recursive edge-flipping
    0 references
    sweep-line
    0 references
    sweep-circle
    0 references
    0 references
    0 references

    Identifiers