Pages that link to "Item:Q582095"

The following pages link to Finding the upper envelope of n line segments in O(n log n) time (Q582095):

Displaying 20 items.

• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
• Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
• Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing (Q489760) (← links)
• Fast algorithm for partial covers in words (Q493243) (← links)
• Planar lower envelope of monotone polygonal chains (Q495682) (← links)
• Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks (Q496433) (← links)
• Minimizing the weighted directed Hausdorff distance between colored point sets under translations and rigid motions (Q620951) (← links)
• Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
• Fréchet distance between a line and avatar point set (Q722543) (← links)
• On a pair of job-machine assignment problems with two stages (Q732901) (← links)
• A persistence landscapes toolbox for topological statistics (Q739618) (← links)
• Computing shortest transversals (Q757096) (← links)
• Minimum-width double-strip and parallelogram annulus (Q784485) (← links)
• On the minimum-area rectangular and square annulus problem (Q827319) (← links)
• (Q5091004) (← links)
• (Q5091032) (← links)
• The existence of horizontal envelopes in the 3D-Heisenberg group (Q5108946) (← links)
• (Q5136216) (← links)
• Parametric matroid interdiction (Q6122085) (← links)