scientific article; zbMATH DE number 4062593

MaRDI QIDQ3796750zbMATH OpenFDO

Authors Leonidas Guibas, Mark H. Overmars, Micha Sharir

Publication date 1988

zbMATH Keywords

arrangements of line segmentscomputational geometrygeometric partitioningpartition treesrange searchingray shooting

Mathematics Subject Classification ID

Other problems of combinatorial convexity (52A37) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 4213488
• scientific article; zbMATH DE number 176772
• Ray shooting in polygons using geodesic triangulations
• scientific article; zbMATH DE number 432986
• Intersection graphs of rays and grounded segments
• Intersection graphs of rays and grounded segments
• An optimal algorithm for intersecting line segments in the plane
• Algorithms for ray-shooting and intersection searching
• scientific article; zbMATH DE number 4049401
• Capturing crossings: convex hulls of segment and plane intersections

Cited in

(24)

• Topological sweep of the complete graph
• Applications of a new space-partitioning technique
• Implicitly representing arrangements of lines or segments
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• An improved technique for output-sensitive hidden surface removal
• Information-seeking control under visibility-based uncertainty
• Computing the intersection-depth to polyhedra
• Lines through segments in 3D space
• scientific article; zbMATH DE number 432986 (Why is no real title available?)
• On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
• scientific article; zbMATH DE number 49092 (Why is no real title available?)
• Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
• scientific article; zbMATH DE number 177563 (Why is no real title available?)
• An optimal algorithm for intersecting line segments in the plane
• New upper bounds for generalized intersection searching problems
• Infimaximal Frames: A Technique for Making Lines Look Like Segments
• Space searching for intersecting objects
• Properties of a level set algorithm for the visibility problems
• Algorithms for subpath convex hull queries and ray-shooting among segments
• On counting pairs of intersecting segments and off-line triangle range searching
• Efficient computation of crossing components and shortcut hulls
• Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
• A deterministic partition tree and applications
• Storing line segments in partition trees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3796750)