Pages that link to "Item:Q4015978"
From MaRDI portal
The following pages link to New Results on Dynamic Planar Point Location (Q4015978):
Displaying 16 items.
- A faster algorithm for computing motorcycle graphs (Q471142) (← links)
- Bottleneck detour tree of points on a path (Q670710) (← links)
- Linear-time construction of treaps and Cartesian trees (Q1339378) (← links)
- Characterizing and efficiently computing quadrangulations of planar point sets (Q1389729) (← links)
- Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os (Q1741853) (← links)
- I/O-efficient dynamic planar point location (Q1882856) (← links)
- Computing shortest heterochromatic monotone routes (Q2517794) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- Towards an Optimal Method for Dynamic Planar Point Location (Q4562277) (← links)
- INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS (Q4682199) (← links)
- Quadrangulations of planar sets (Q5057435) (← links)
- Dynamic Planar Point Location in External Memory. (Q5088984) (← links)
- Point Location in Incremental Planar Subdivisions. (Q5091043) (← links)
- (Q5116523) (← links)
- External memory planar point location with logarithmic updates (Q5920252) (← links)
