Voronoi diagrams from convex hulls (Q1135110): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56070313, #quickstatements; #temporary_batch_1714639695901
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Divide and conquer for linear expected time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Convex Hull Algorithm for Planar Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Printer graphics for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of a Point in a Planar Subdivision and Its Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex hulls of finite sets of points in two and three dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the intersection of n half-spaces in time O(n log n) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133127 / rank
 
Normal rank

Latest revision as of 03:02, 13 June 2024

scientific article
Language Label Description Also known as
English
Voronoi diagrams from convex hulls
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references