Pages that link to "Item:Q3016253"
From MaRDI portal
The following pages link to Delaunay triangulations in <i>O</i> (sort( <i>n</i> )) time and more (Q3016253):
Displaying 11 items.
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- On sorting triangles in a Delaunay tessellation (Q802898) (← links)
- Linear-time reconstruction of Delaunay triangulations with applications (Q826118) (← links)
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets (Q906836) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Fast range searching with Delaunay triangulations (Q2783173) (← links)
- (Q4037406) (← links)
- (Q5075809) (← links)
- Preprocessing Ambiguous Imprecise Points (Q5088972) (← links)
- Dynamic smooth compressed quadtrees (Q5115813) (← links)
- Computing Minimal Triangulations in Time O(nalpha log n) = o(n2.376) (Q5470799) (← links)