Pages that link to "Item:Q582095"
From MaRDI portal
The following pages link to Finding the upper envelope of n line segments in O(n log n) time (Q582095):
Displaying 50 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)
- Efficient algorithms for combined heat and power production planning under the deregulated electricity market (Q852994) (← links)
- Undesirable facility location problems on multicriteria networks (Q853902) (← links)
- A polynomial algorithm for the multicriteria cent-dian location problem (Q864019) (← links)
- An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- Capturing crossings: convex hulls of segment and plane intersections (Q963438) (← links)
- Largest empty circle centered on a query line (Q972354) (← links)
- An algorithmic toolbox for network calculus (Q1020549) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← links)
- Computing the dilation of edge-augmented graphs in metric spaces (Q1037772) (← links)
- Compaction and separation algorithms for non-convex polygons and their applications (Q1127207) (← links)
- Upper envelope onion peeling (Q1199830) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- Geometric methods to solve max-ordering location problems (Q1289016) (← links)
- On the union of fat wedges and separating a collection of segments by a line (Q1314526) (← links)
- Visibility with a moving point of view (Q1322569) (← links)
- Excess in arrangements of segments (Q1349964) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- Remarks on the computation of the horizon of a digital terrain (Q1412555) (← links)
- Computing a minimum-width square or rectangular annulus with outliers (Q1624585) (← links)
- Routing in a polygonal terrain with the shortest beacon watchtower (Q1699277) (← links)
- Computing a minimum-width square annulus in arbitrary orientation (Q1705772) (← links)
- Optimal output-sensitive convex hull algorithms in two and three dimensions (Q1816462) (← links)
- Robot motion planning and the single cell problem in arrangements (Q1842755) (← links)
- Translating a regular grid over a point set (Q1873153) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- Computing depth orders for fat objects and related problems (Q1917032) (← links)
- Computing half-plane and strip discrepancy of planar point sets (Q1917044) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- Characterization and computation of feasible trajectories for an articulated probe with a variable-length end segment (Q1984612) (← links)
- Optimizing generalized kernels of polygons (Q2046316) (← links)
- The maximum-level vertex in an arrangement of lines (Q2117347) (← links)
- The robust bilevel continuous knapsack problem with uncertain coefficients in the follower's objective (Q2154452) (← links)
