Robust Plane Sweep for Intersecting Segments
From MaRDI portal
Recommendations
Cited in
(15)- On the degree of standard geometric predicates for line transversals in 3D
- Algebraic methods and arithmetic filtering for exact predicates on circle arcs
- Rounding Voronoi diagram
- Practical segment intersection with finite precision output
- Optimal and suboptimal robust algorithms for proximity graphs
- Line segment intersection testing
- An exact and efficient approach for computing a cell in an arrangement of quadrics
- Computing the Implicit Voronoi Diagram in Triple Precision
- A low arithmetic-degree algorithm for computing proximity graphs
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
- scientific article; zbMATH DE number 1926667 (Why is no real title available?)
- Infimaximal Frames: A Technique for Making Lines Look Like Segments
- An elementary algorithm for reporting intersections of red/blue curve segments
- Move schedules: fast persistence computations in coarse dynamic settings
- The unpredictable deviousness of models
This page was built for publication: Robust Plane Sweep for Intersecting Segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943876)