Pages that link to "Item:Q1260355"
From MaRDI portal
The following pages link to Finding the intersection of n half-spaces in time O(n log n) (Q1260355):
Displaying 13 items.
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Mechanical parts orienting: the case of a polyhedron on a table (Q686747) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- An optimal parallel algorithm for linear programming in the plane (Q915450) (← links)
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Linear programming in \({\mathbb{R}}^ 3\) and the skeleton and largest incircle of a convex polygon (Q1102184) (← links)
- Finding the convex hull of a sorted point set in parallel (Q1108791) (← links)
- The shortest watchtower and related problems for polyhedral terrains (Q1114400) (← links)
- Voronoi diagrams from convex hulls (Q1135110) (← links)
- Optimal parallel algorithms for point-set and polygon problems (Q1187196) (← links)
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
- Faster goal-oriented shortest path search for bulk and incremental detailed routing (Q2164671) (← links)
- Computing the shortest watchtower of a polyhedral terrain in \(O(n\log n)\) time. (Q2482906) (← links)
