Pages that link to "Item:Q2489542"
From MaRDI portal
The following pages link to Farthest-point queries with geometric and combinatorial constraints (Q2489542):
Displaying 12 items.
- On the all-farthest-segments problem for a planar set of points (Q845846) (← links)
- Constrained minimum enclosing circle with center on a query line segment (Q924081) (← links)
- Optimal simplification of polygonal chains for subpixel-accurate rendering (Q950399) (← links)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
- Data structures for halfplane proximity queries and incremental Voronoi diagrams (Q1755746) (← links)
- Trajectory planning for an articulated probe (Q2206741) (← links)
- Computing closest and farthest points for a query segment (Q2481974) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- Baseline bounded half-plane Voronoi diagram (Q2864864) (← links)
- Optimal Data Structures for Farthest-Point Queries in Cactus Networks (Q2940594) (← links)
- Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions (Q3082972) (← links)