Delaunay Triangulation of Imprecise Points Simplified and Extended (Q3183447): 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 / 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.1007/978-3-642-03367-4_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2147499882 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximating the Depth and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provably good mesh generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL CONSTRUCTION OF QUADTREES AND QUALITY TRIANGULATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient update strategies for geometric computing with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating a simple polygon in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting a Delaunay triangulation in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing hereditary convex structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-improving algorithms for delaunay triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear size binary space partitions for uncluttered scenes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guarding scenes against invasive hypercubes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realistic input models for geometric algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON COMPUTING VORONOI DIAGRAMS FOR SORTED POINT SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A CONVEX HULL ALGORITHM FOR POINTS WITH APPROXIMATELY KNOWN POSITIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing strongly convex approximate hulls with inaccurate primitives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating input-constrained planar point sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delaunay triangulations of imprecise pointsin linear time after preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing Imprecise Points and Splitting Triangulations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:25, 2 July 2024

scientific article
Language Label Description Also known as
English
Delaunay Triangulation of Imprecise Points Simplified and Extended
scientific article

    Statements

    Delaunay Triangulation of Imprecise Points Simplified and Extended (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 October 2009
    0 references

    Identifiers