Pages that link to "Item:Q3740283"
From MaRDI portal
The following pages link to Constructing Arrangements of Lines and Hyperplanes with Applications (Q3740283):
Displaying 50 items.
- An approximation algorithm for least median of squares regression (Q290249) (← links)
- Straight skeletons and mitered offsets of nonconvex polytopes (Q331386) (← links)
- Witness Gabriel graphs (Q359756) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Approximation algorithms for free-label maximization (Q419365) (← links)
- Computing optimal islands (Q433119) (← links)
- Shape matching by random sampling (Q441886) (← links)
- New complexity bounds for image matching under rotation and scaling (Q533416) (← links)
- Algorithms for marketing-mix optimization (Q547308) (← links)
- Witness (Delaunay) graphs (Q551502) (← links)
- The complexity and construction of many faces in arrangements of lines and of segments (Q582900) (← links)
- The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
- Efficient view point selection for silhouettes of convex polyhedra (Q634248) (← links)
- Graph problems arising from parameter identification of discrete dynamical systems (Q634788) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- Reaching a goal with directional uncertainty (Q673767) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Geometric matching algorithms for two realistic terrains (Q683754) (← links)
- A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218) (← links)
- Algorithms for weak and wide separation of sets (Q686422) (← links)
- Constructions and complexity of secondary polytopes (Q750909) (← links)
- A deterministic view of random sampling and its use in geometry (Q751816) (← links)
- A dual approach to detect polyhedral intersections in arbitrary dimensions (Q758179) (← links)
- On levels in arrangements and Voronoi diagrams (Q804321) (← links)
- A linear optimization oracle for zonotope computation (Q824329) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- An optimal algorithm for the boundary of a cell in a union of rays (Q911755) (← links)
- Searching for empty convex polygons (Q911758) (← links)
- Triangulating a nonconvex polytope (Q914375) (← links)
- Algorithms for high dimensional stabbing problems (Q916570) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Partitioning arrangements of lines. II: Applications (Q921915) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- Efficient algorithms for maximum regression depth (Q938312) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation (Q1038471) (← links)
- Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time (Q1062764) (← links)
- The power of geometric duality revisited (Q1068550) (← links)
- Halfspace range search: An algorithmic application of k-sets (Q1077166) (← links)
- The complexity of cells in three-dimensional arrangements (Q1078804) (← links)
- Voronoi diagrams and arrangements (Q1079823) (← links)
- Visibility of disjoint polygons (Q1087340) (← links)
- Edge-skeletons in arrangements with applications (Q1091825) (← links)
- Polygonizations of point sets in the plane (Q1093906) (← links)
- Recognising polytopical cell complexes and constructing projection polyhedra (Q1096404) (← links)
- Lower bounds on moving a ladder in two and three dimensions (Q1104091) (← links)
- Verifiable implementations of geometric algorithms using finite precision arithmetic (Q1116270) (← links)
- Topologically sweeping an arrangement (Q1122981) (← links)
