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):
Displayed 37 items.
- Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
- Computing shortest transversals (Q757096) (← 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)
- An algorithmic toolbox for network calculus (Q1020549) (← links)
- Kinetic maintenance of mobile \(k\)-centres on trees (Q1028114) (← 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)
- 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)
- Orthogonal weightet linear \(L_ 1\) and \(L_ \infty\) approximation and applications (Q2367406) (← links)
- Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor (Q2383600) (← links)
- Visibility maps of segments and triangles in 3D (Q2477193) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- An improved method for calculating the no-fit polygon (Q2581595) (← links)
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN (Q3373053) (← links)
- An Output-Sensitive Convex Hull Algorithm for Planar Objects (Q4513200) (← links)
- Kinetic Maintenance of Mobile k-Centres on Trees (Q5387769) (← links)
- CONTINUOUS PATH VERIFICATION IN MULTI-AXIS NC-MACHINING (Q5694055) (← links)
- Linear approximation of simple objects (Q5906528) (← links)
- Separating objects in the plane by wedges and strips (Q5929324) (← links)
- The maximum absolute deviation measure in location problems on networks (Q5954836) (← links)