Efficient algorithms for line and curve segment intersection using restricted predicates
From MaRDI portal
Recommendations
- An optimal algorithm for intersecting line segments in the plane
- Reporting curve segment intersections using restricted predicates
- Fast dynamic intersection searching in a set of isothetic line segments
- On intersection searching problems involving curved objects
- Efficient dynamic algorithms for some geometric intersection problems
- Constrained integer approximation to planar line intersection
- Intersection algorithms for lines and circles
- Algorithms for intersecting parametric and algebraic curves I
- Segment intersection searching problems in general settings
- Segment intersection searching problems in general settings
Cited in
(9)- Move schedules: fast persistence computations in coarse dynamic settings
- Fast dynamic intersection searching in a set of isothetic line segments
- Optimal and suboptimal robust algorithms for proximity graphs
- Line-segment intersection made in-place
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- An elementary algorithm for reporting intersections of red/blue curve segments
- Reporting intersections among thick objects.
- Reporting curve segment intersections using restricted predicates
- Moving coins
This page was built for publication: Efficient algorithms for line and curve segment intersection using restricted predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567304)
