Pages that link to "Item:Q419363"
From MaRDI portal
The following pages link to On a class of \(O(n^2)\) problems in computational geometry (Q419363):
Displaying 9 items.
- Three-dimensional weak visibility: Complexity and applications (Q1575678) (← links)
- Generalized hidden surface removal (Q1917036) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- Bottleneck convex subsets: finding \(k\) large convex sets in a point set (Q2695286) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- (Q4638059) (← links)
- Minimizing Distance-to-Sight in Polygonal Domains (Q5091052) (← links)
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle (Q5092506) (← links)
- Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set (Q6173215) (← links)
