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 38 items.
- GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA (Q3373056) (← links)
- Finding Pairwise Intersections Inside a Query Range (Q3449820) (← links)
- On Faster Integer Calculations Using Non-arithmetic Primitives (Q3543338) (← links)
- Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time (Q3558019) (← links)
- A LOWER BOUND ON THE AREA OF A 3-COLOURED DISK PACKING (Q3575389) (← links)
- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard (Q3637111) (← links)
- The Computational Geometry of Comparing Shapes (Q3644725) (← links)
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction (Q4513199) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- The Complexity of Problems in P Given Correlated Instances (Q4638062) (← links)
- POLYGON CONTAINMENT AND TRANSLATIONAL IN-HAUSDORFF-DISTANCE BETWEEN SEGMENT SETS ARE 3SUM-HARD (Q4682166) (← links)
- Computing Large Planar Regions in Terrains (Q4917094) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- A subquadratic algorithm for 3XOR (Q5005162) (← links)
- (Q5009597) (← links)
- (Q5009621) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC-machining (Q5057431) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- On some geometric optimization problems in layered manufacturing (Q5096933) (← links)
- On Multidimensional and Monotone k-SUM (Q5111265) (← links)
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy (Q5111730) (← links)
- (Q5116497) (← links)
- REPORTING BICHROMATIC SEGMENT INTERSECTIONS FROM POINT SETS (Q5300004) (← links)
- Exact Weight Subgraphs and the k-Sum Conjecture (Q5326545) (← links)
- REGION INTERVISIBILITY IN TERRAINS (Q5386744) (← links)
- FITTING FLATS TO POINTS WITH OUTLIERS (Q5388712) (← links)
- (Q5875468) (← links)
- Efficiently stabbing convex polygons and variants of the Hadwiger-Debrunner \((p, q)\)-theorem (Q5881548) (← links)
- Parameterized aspects of triangle enumeration (Q5915757) (← links)
- Algorithms for Radon partitions with tolerance (Q5918766) (← links)
- Three dimensional weak visibility: Complexity and applications (Q6064014) (← links)
- How fast can we play Tetris greedily with rectangular pieces? (Q6149495) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
- Separating and shattering long line segments (Q6487423) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)
