The following pages link to (Q3796750):
Displaying 14 items.
- Properties of a level set algorithm for the visibility problems (Q618356) (← links)
- On counting pairs of intersecting segments and off-line triangle range searching (Q676268) (← links)
- Storing line segments in partition trees (Q911289) (← links)
- Topological sweep of the complete graph (Q1003474) (← links)
- Applications of a new space-partitioning technique (Q1196362) (← links)
- Implicitly representing arrangements of lines or segments (Q1263966) (← links)
- Algorithms for bichromatic line-segment problems and polyhedral terrains (Q1314429) (← links)
- An improved technique for output-sensitive hidden surface removal (Q1322562) (← links)
- Information-seeking control under visibility-based uncertainty (Q2251228) (← links)
- Computing the intersection-depth to polyhedra (Q2366234) (← links)
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm (Q3978777) (← links)
- An optimal algorithm for intersecting line segments in the plane (Q4302817) (← links)
- New upper bounds for generalized intersection searching problems (Q4645201) (← links)
- Algorithms for subpath convex hull queries and ray-shooting among segments (Q6593765) (← links)
