Computing closest and farthest points for a query segment (Q2481974): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Constructing Levels in Arrangements and Higher Order Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING CLOSEST POINTS FOR SEGMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries with segments in 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: Geometric retrieval problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment / 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 power of geometric duality revisited / rank
 
Normal rank

Latest revision as of 21:30, 27 June 2024

scientific article
Language Label Description Also known as
English
Computing closest and farthest points for a query segment
scientific article

    Statements