Pages that link to "Item:Q1886235"

The following pages link to Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment (Q1886235):

Displaying 8 items.

• Maximum-area and maximum-perimeter rectangles in polygons (Q827336) (← links)
• Chromatic distribution of \(k\)-nearest neighbors of a line segment in a planar colored point set (Q845996) (← links)
• Improved algorithm for the widest empty 1-corner corridor (Q989575) (← links)
• Smallest \(k\)-point enclosing rectangle and square of arbitrary orientation (Q1041762) (← links)
• Algorithmic enumeration of surrounding polygons (Q1983143) (← links)
• Computing closest and farthest points for a query segment (Q2481974) (← links)
• Polynomial Time Algorithms for Bichromatic Problems (Q2971630) (← links)
• Improved Algorithm for a Widest 1-Corner Corridor (Q3605487) (← links)