The following pages link to (Q3134498):
Displaying 43 items.
- Far-field reflector problem and intersection of paraboloids (Q315717) (← links)
- An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
- Randomized parallel list ranking for distributed memory multiprocessors. (Q676261) (← links)
- Efficient decentralized algorithms for the distributed trigger counting problem (Q693074) (← links)
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- An introduction to randomization in computational geometry (Q1351693) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- On the computation of zone and double zone diagrams (Q1704894) (← links)
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces (Q1816466) (← links)
- Union and split operations on dynamic trapezoidal maps (Q1841116) (← links)
- A decomposition-based approach to layered manufacturing (Q1862118) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- Tight upper bounds for the discrepancy of half-spaces (Q1892434) (← links)
- Testing nonlinear operators (Q1895875) (← links)
- A compact piecewise-linear Voronoi diagram for convex sites in the plane (Q1907612) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- Average case analysis of dynamic geometric optimization (Q1917043) (← links)
- Point location in zones of \(k\)-flats in arrangements (Q1917049) (← links)
- Randomized geometric algorithms and pseudorandom generators (Q1923860) (← links)
- Randomized search trees (Q1923861) (← links)
- Faster approximate diameter and distance oracles in planar graphs (Q1999961) (← links)
- Randomized incremental construction of Delaunay triangulations of nice point sets (Q2039315) (← links)
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem (Q2268516) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- On the complexity of randomly weighted multiplicative Voronoi diagrams (Q2349856) (← links)
- Exact computation of the medial axis of a polyhedron (Q2388543) (← links)
- An efficient randomized algorithm for higher-order abstract Voronoi diagrams (Q2414862) (← links)
- Geometrie und Kombinatorik von Nash-Gleichgewichten. (Q2491987) (← links)
- Learning big (image) data via coresets for dictionaries (Q2513397) (← links)
- Nearest neighbor representations of Boolean functions (Q2672259) (← links)
- An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane (Q2710773) (← links)
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE (Q4661880) (← links)
- Efficient algorithms for computing the $L_2$-discrepancy (Q4718412) (← links)
- Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts (Q5041732) (← links)
- (Q5075759) (← links)
- GEOMETRIC STREAMING ALGORITHM WITH A SORTING PRIMITIVE (Q5305061) (← links)
- REGION INTERVISIBILITY IN TERRAINS (Q5386744) (← links)
- Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions (Q5864671) (← links)
- On lazy randomized incremental construction (Q5917712) (← links)
- A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions (Q5929327) (← links)
- Maximum matchings in geometric intersection graphs (Q6050213) (← links)
