An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (Q2380039): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2007.08.004 / rank
Normal rank
 
Property / author
 
Property / author: Robert L. Scot Drysdale / rank
Normal rank
 
Property / author
 
Property / author: Asish Kumar Mukhopadhyay / rank
Normal rank
 
Property / author
 
Property / author: Robert L. Scot Drysdale / rank
 
Normal rank
Property / author
 
Property / author: Asish Kumar Mukhopadhyay / 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.ipl.2007.08.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170820578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farthest line segment Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-point site Voronoi diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4361347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity problems on line segments spanned by points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of Voronoi Diagrams in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the all-farthest-segments problem for a planar set of points / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2007.08.004 / rank
 
Normal rank

Latest revision as of 07:21, 18 December 2024

scientific article
Language Label Description Also known as
English
An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points
scientific article

    Statements

    An \(O(n\log n)\) algorithm for the all-farthest-segments problem for a planar set of points (English)
    0 references
    24 March 2010
    0 references
    computational geometry
    0 references
    farthest-segment Voronoi diagram
    0 references

    Identifiers