Pages that link to "Item:Q3740283"
From MaRDI portal
The following pages link to Constructing Arrangements of Lines and Hyperplanes with Applications (Q3740283):
Displaying 19 items.
- Convex polygons made from few lines and convex decompositions of polyhedra (Q5056156) (← links)
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining (Q5057431) (← links)
- Probing a set of hyperplanes by lines and related problems (Q5060099) (← links)
- Maintaining proximity in higher dimensional spaces (Q5096861) (← links)
- (Q5111239) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- Minimal Representations of Order Types by Geometric Graphs (Q5141642) (← links)
- A tail estimate for Mulmuley's segment intersection algorithm (Q5204337) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q5370571) (← links)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
- Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations (Q5376454) (← links)
- A new duality result concerning Voronoi diagrams (Q5899690) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)
- Computing unique three-dimensional object aspects representation (Q5946319) (← links)
- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design (Q6560224) (← links)
- The edge labeling of higher order Voronoi diagrams (Q6618154) (← links)
- The complexity of order type isomorphism (Q6624165) (← links)
- A normal fan projection algorithm for low-rank optimization (Q6665394) (← links)
