Partitioning arrangements of lines. I: An efficient deterministic algorithm
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- A fast Las Vegas algorithm for triangulating a simple polygon
- A linear time algorithm for minimum link paths inside a simple polygon
- An Optimal-Time Algorithm for Slope Selection
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Constructing Belts in Two-Dimensional Arrangements with Applications
- Construction of \(\epsilon\)-nets
- Implicitly representing arrangements of lines or segments
- More on k-sets of finite sets in the plane
- New applications of random sampling in computational geometry
- On k-Hulls and Related Problems
- Partitioning arrangements of lines. II: Applications
- Red-Blue Intersection Detection Algorithms, with Applications to Motion Planning and Collision Detection
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
- The complexity and construction of many faces in arrangements of lines and of segments
- -nets and simplex range queries
Cited in
(26)- An improved technique for output-sensitive hidden surface removal
- A Linear Time Algorithm for Ordered Partition
- Cutting hyperplane arrangements
- Storing line segments in partition trees
- A fast planar partition algorithm. I
- Cuttings for disks and axis-aligned rectangles in three-space
- On counting pairs of intersecting segments and off-line triangle range searching
- Range searching with efficient hierarchical cuttings
- Partitioning axis-parallel lines in 3D
- An optimal convex hull algorithm in any fixed dimension
- A fast planar partition algorithm, II
- Cutting hyperplanes for divide-and-conquer
- Partitioning with two lines in the plane
- Optimal deterministic algorithms for 2-d and 3-d shallow cuttings
- A simple algorithm for r-gatherings on the line
- AN EXPERIMENTAL STUDY OF ON-LINE METHODS FOR ZONE CONSTRUCTION IN ARRANGEMENTS OF LINES IN THE PLANE
- Constructing Planar Cuttings in Theory and Practice
- A non-linear lower bound for planar epsilon-nets
- Approximate Levels in Line Arrangements
- Space–Query-Time Tradeoff for Computing the Visibility Polygon
- Ray shooting on triangles in 3-space
- Fair Partitioning by Straight Lines
- New two-line arrays representing partitions
- Minimum plane bichromatic spanning trees
- Approximating the k-Level in Three-Dimensional Plane Arrangements
- Partitioning arrangements of lines. II: Applications
This page was built for publication: Partitioning arrangements of lines. I: An efficient deterministic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914373)
