Partitioning arrangements of lines. II: Applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A theorem on arrangements of lines in the plane
- Algorithms for Reporting and Counting Geometric Intersections
- Algorithms for bichromatic line-segment problems and polyhedral terrains
- An optimal algorithm for intersecting line segments in the plane
- Combinatorial complexity bounds for arrangements of curves and spheres
- Comments on “algorithms for reporting and counting geometric intersections”
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Construction of \(\epsilon\)-nets
- Extremal problems in discrete geometry
- Fractional cascading. II: Applications
- Good splitters for counting points in triangles
- Implicitly representing arrangements of lines or segments
- Lines in space: Combinatorics and algorithms
- Lower Bounds on the Complexity of Polytope Range Searching
- New applications of random sampling in computational geometry
- On k-Hulls and Related Problems
- On the maximal number of edges of many faces in an arrangement
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Quasi-optimal range searching in spaces of finite VC-dimension
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
- Reporting and counting segment intersections
- Spanning trees with low crossing number
- The complexity and construction of many faces in arrangements of lines and of segments
- The power of geometric duality
- Topologically sweeping an arrangement
- \(\epsilon\)-nets and simplex range queries
Cited in
(33)- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Connected component and simple polygon intersection searching
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Implicitly representing arrangements of lines or segments
- Ray shooting on triangles in 3-space
- Approximating the packedness of polygonal curves
- On counting pairs of intersecting segments and off-line triangle range searching
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- A fast planar partition algorithm. I
- The exact fitting problem in higher dimensions
- Efficient partition trees
- Efficient non-intersection queries on aggregated geometric data
- A non-linear lower bound for planar epsilon-nets
- Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
- Planar bichromatic minimum spanning trees
- Finding specified sections of arrangements: 2D results
- Connected component and simple polygon intersection searching
- Reporting bichromatic segment intersections from point sets
- Finding simplices containing the origin in two and three dimensions
- Partitioning arrangements of lines. I: An efficient deterministic algorithm
- Constructing arrangements optimally in parallel
- New lower bounds for Hopcroft's problem
- Counting and representing intersections among triangles in three dimensions
- New two-line arrays representing partitions
- A note on searching line arrangements and applications
- Applications of a new space-partitioning technique
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- Cutting hyperplanes for divide-and-conquer
- Line arrangements and range search
- Cutting hyperplane arrangements
- Triangulating with high connectivity.
- Approximating the Packedness of Polygonal Curves
- Planar Bichromatic Bottleneck Spanning Trees
This page was built for publication: Partitioning arrangements of lines. II: Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921915)
