Pages that link to "Item:Q1903639"
From MaRDI portal
The following pages link to On a class of \(O(n^ 2)\) problems in computational geometry (Q1903639):
Displaying 50 items.
- 3SUM, 3XOR, triangles (Q261365) (← links)
- Separating and shattering long line segments (Q293158) (← links)
- Asymmetric polygons with maximum area (Q320859) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- On a class of \(O(n^2)\) problems in computational geometry (Q419363) (← links)
- On \(k\)-convex polygons (Q427049) (← links)
- Minimizing the error of linear separators on linearly inseparable data (Q427883) (← links)
- On the least trimmed squares estimator (Q472475) (← links)
- Improved subquadratic 3SUM (Q513274) (← links)
- Perfect binary space partitions (Q676587) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Algorithmic complexity of a problem of idempotent convex geometry. (Q869763) (← links)
- Selecting distances in arrangements of hyperplanes spanned by points. (Q878011) (← links)
- Covering point sets with two disjoint disks or squares (Q929745) (← links)
- Hardness of comparing two run-length encoded strings (Q990818) (← links)
- Enclosing weighted points with an almost-unit ball (Q990963) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Facility location problems in the plane based on reverse nearest neighbor queries (Q1038383) (← links)
- On triangulating three-dimensional polygons (Q1392846) (← links)
- On finding an empty staircase polygon of largest area (width) in a planar point-set (Q1405008) (← links)
- Preprocessing chains for fast dihedral rotations is hard or even impossible. (Q1410594) (← links)
- Speeding up the incremental construction of the union of geometric objects in practice. (Q1421031) (← links)
- Shattering a set of objects in 2D (Q1613422) (← links)
- Finding pairwise intersections inside a query range (Q1755743) (← links)
- Computing large planar regions in terrains, with an application to fracture surfaces (Q1827827) (← links)
- The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces (Q1943631) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- Pattern matching and consensus problems on weighted sequences and profiles (Q2000001) (← links)
- Capturing points with a rotating polygon (and a 3D extension) (Q2000002) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model (Q2096389) (← links)
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems (Q2105319) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- On 3SUM-hard problems in the decision tree model (Q2117780) (← links)
- Approximate unions of lines and Minkowski sums (Q2369877) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model (Q2415377) (← links)
- Minimum-link paths revisited (Q2450201) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Subquadratic algorithms for 3SUM (Q2482729) (← links)
- Counting and representing intersections among triangles in three dimensions (Q2571213) (← links)
- On rainbow quadrilaterals in colored point sets (Q2676756) (← links)
- Time and space efficient collinearity indexing (Q2678263) (← links)
- On the optimality of pseudo-polynomial algorithms for integer programming (Q2687057) (← links)
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES (Q3089091) (← links)
- (Q3176596) (← links)
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN (Q3373053) (← links)
