An optimal algorithm for intersecting line segments in the plane
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Topological sweep of the complete graph
- Optimal higher order Delaunay triangulations of polygons
- Fast dynamic intersection searching in a set of isothetic line segments
- An introduction to randomized algorithms
- Searching for segments with largest relative overlap
- Applications of random sampling to on-line algorithms in computational geometry
- Line-segment intersection reporting in parallel
- Counting and cutting cycles of lines and rods in space
- Minimum-link paths among obstacles in the plane
- On the general motion-planning problem with two degrees of freedom
- Implicitly representing arrangements of lines or segments
- An optimal algorithm for solving collision distance between convex polygons in plane
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- On the union of fat wedges and separating a collection of segments by a line
- An introduction to randomization in computational geometry
- Decomposable multi-parameter matroid optimization problems.
- Algebraic properties of location problems with one circular barrier.
- Efficient algorithms for line and curve segment intersection using restricted predicates
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
- Untangling planar curves
- Constructing arrangements optimally in parallel
- Isomorphism of spiral polygons
- Topologically sweeping visibility complexes via pseudotriangulations
- Applications of random sampling in computational geometry. II
- Complexity of projected images of convex subdivisions
- Reporting intersections among thick objects.
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Iterated snap rounding
- Separability by two lines and by nearly straight polygonal chains
- Asymptotic speed-ups in constructive solid geometry
- Sweep methods for parallel computational geometry
- Vertical decompositions for triangles in 3-space
- Randomized geometric algorithms and pseudorandom generators
- Polyhedral circuits and their applications
- The maximum-level vertex in an arrangement of lines
- Geometric multicut: shortest fences for separating groups of objects in the plane
- Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments
- Ray shooting on triangles in 3-space
- A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
- Line-segment intersection made in-place
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- Counting and representing intersections among triangles in three dimensions
- The touring rays and related problems
- Combinatorics of intervals in the plane. I: Trapezoids
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments
- Efficient algorithms for counting and reporting pairwise intersections between convex polygons
- Efficient algorithms for touring a sequence of convex polygons and related problems
- scientific article; zbMATH DE number 4131656 (Why is no real title available?)
- scientific article; zbMATH DE number 432986 (Why is no real title available?)
- Quick algorithm for reconstructing line object adjacency relations
- Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
- Every graph admits an unambiguous bold drawing
- Cache-Oblivious Red-Blue Line Segment Intersection
- An algorithm for intersections determination among geometric buffers using skip lists
- GUARDING A POLYGON FROM TWO NEARLY-OPPOSITE DIRECTIONS
- MINIMUM SEPARATION IN WEIGHTED SUBDIVISIONS
- An $O(E\log E + I)$ Expected Time Algorithm for the Planar Segment Intersection Problem
- scientific article; zbMATH DE number 4062593 (Why is no real title available?)
- On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm
- On computing connected components of line segments
- Rounding Arrangements Dynamically
- Decision Trees for Geometric Models
- New upper bounds for generalized intersection searching problems
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- OPTIMAL POLYGON COVER PROBLEMS AND APPLICATIONS
- Infimaximal Frames: A Technique for Making Lines Look Like Segments
- scientific article; zbMATH DE number 1424323 (Why is no real title available?)
- ON COMPUTING TRANSLATIONAL SWEPT VOLUMES
- scientific article; zbMATH DE number 1445286 (Why is no real title available?)
- Using sparsification for parametric minimum spanning tree problems
- Point probe decision trees for geometric concept classes
- Filling polyhedral molds
- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
- Geometric multicut
- A tail estimate for Mulmuley's segment intersection algorithm
- A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
- Locating an obnoxious line among planar objects
- Reporting bichromatic segment intersections from point sets
- RED-BLUE SEPARABILITY PROBLEMS IN 3D
- Algorithms and Data Structures
- Optimal Higher Order Delaunay Triangulations of Polygons
- OVERLAYING SURFACE MESHES, PART I: ALGORITHMS
- On finding ordinary or monochromatic intersection points
- Techniques and open questions in computational convex analysis
- An optimal online algorithm for halfplane intersection
- An elementary algorithm for reporting intersections of red/blue curve segments
- External-memory algorithms for processing line segments in geographic information systems
- Path planning in a weighted planar subdivision under the Manhattan metric
- Efficient view point selection for silhouettes of convex polyhedra
- Bold graph drawings
- Concyclic intervals in the plane
- On counting pairs of intersecting segments and off-line triangle range searching
- Sweeping arrangements of non-piercing regions in the plane
- An algebraic algorithm to compute the exact general sweep boundary of a 2D curved object
- Sweeping arrangements of non-piercing regions in the plane
- Efficient computation of crossing components and shortcut hulls
- An O(n n) algorithm for single-source shortest paths in disk graphs
- Geometric algorithms for finding a point in the intersection of balls
- An intersection-sensitive algorithm for snap rounding
- Near-linear-time deterministic plane Steiner spanners for well-spaced point sets
This page was built for publication: An optimal algorithm for intersecting line segments in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302817)
