Pages that link to "Item:Q911289"
From MaRDI portal
The following pages link to Storing line segments in partition trees (Q911289):
Displaying 12 items.
- Range searching with efficient hierarchical cuttings (Q685179) (← links)
- Dynamic partition trees (Q804289) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Intersection queries in sets of disks (Q1196457) (← links)
- Efficient ray shooting and hidden surface removal (Q1330784) (← links)
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
- Connected component and simple polygon intersection searching (Q1918994) (← links)
- A note on small linear-ordering polytopes (Q2368130) (← links)
- Approximate range searching using binary space partitions (Q2489539) (← links)
- Intersection queries in sets of disks (Q5056120) (← links)
- Dynamic partition trees (Q5056121) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)