The higher-order Voronoi diagram of line segments (Q261375): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W2004336806 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.3806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for computing the Voronoi diagram of a convex polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIMPLE ON-LINE RANDOMIZED INCREMENTAL ALGORITHM FOR COMPUTING HIGHER ORDER VORONOI DIAGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest line segment Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voronoi Diagrams and Delaunay Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Higher Order Abstract Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm for Constructing kth-Order Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest-polygon Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: New applications of random sampling in computational geometry / 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: Two-Dimensional Voronoi Diagrams in the <i> L <sub>p</sub> </i> -Metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabbing line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Voronoi diagrams revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Nearest Neighbor Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-nearest-neighbor Voronoi diagram revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: FURTHEST SITE ABSTRACT VORONOI DIAGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE FARTHEST LINE-SEGMENT VORONOI DIAGRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Higher Order Voronoi Diagrams of Line Segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order-k Voronoi diagrams of sites with additive weights in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nature and meaning of perturbations in geometric computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Clarkson–Shor Technique Revisited and Extended / rank
 
Normal rank

Latest revision as of 16:44, 11 July 2024

scientific article
Language Label Description Also known as
English
The higher-order Voronoi diagram of line segments
scientific article

    Statements

    The higher-order Voronoi diagram of line segments (English)
    0 references
    0 references
    23 March 2016
    0 references
    0 references
    computational geometry
    0 references
    Voronoi diagram
    0 references
    line segments
    0 references
    planar straight line graph
    0 references
    order-\(k\) Voronoi diagram
    0 references
    \(k\) nearest neighbors
    0 references
    \(L_p\) metric
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references