Pages that link to "Item:Q2481974"
From MaRDI portal
The following pages link to Computing closest and farthest points for a query segment (Q2481974):
Displaying 8 items.
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
- Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set (Q845996) (← links)
- Queries with segments in Voronoi diagrams (Q1567303) (← links)
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235) (← links)
- Proximity problems on line segments spanned by points (Q2489537) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions (Q3082972) (← links)
- Searching for the closest-pair in a query translate (Q5088994) (← links)