Algorithms for bichromatic line-segment problems and polyhedral terrains
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3919830 (Why is no real title available?)
- scientific article; zbMATH DE number 4062593 (Why is no real title available?)
- An Optimal-Time Algorithm for Slope Selection
- An algorithm for generalized point location and its applications
- An optimal algorithm for intersecting line segments in the plane
- Computing convolutions by reciprocal search
- Cutting hyperplanes for divide-and-conquer
- Fractional cascading. I: A data structuring technique
- Lines in space: Combinatorics and algorithms
- Optimal Point Location in a Monotone Subdivision
- Rectilinear line segment intersection, layered segment trees, and dynamization
- Reporting and counting segment intersections
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- The shortest watchtower and related problems for polyhedral terrains
Cited in
(40)- Placing Text Boxes on Graphs
- Polynomial time algorithms for bichromatic problems
- Finding a largest-area triangle in a terrain in near-linear time
- Finding a largest-area triangle in a terrain in near-linear time
- On the number of regular vertices of the union of Jordan regions
- Multidimensional segment trees can do range updates in poly-logarithmic time
- On the number of regular vertices of the union of Jordan regions
- OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
- On counting pairs of intersecting segments and off-line triangle range searching
- scientific article; zbMATH DE number 7559117 (Why is no real title available?)
- Sets of lines and cutting out polyhedral objects
- On constant factors in comparison-based geometric algorithms and data structures
- Computing depth orders for fat objects and related problems
- Region-restricted clustering for geographic data mining
- On ray shooting for triangles in 3-space and related problems
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
- On lines missing polyhedral sets in 3-space
- Hopcroft's problem, log* shaving, two-dimensional fractional cascading, and decision trees
- On ray shooting for triangles in 3-space and related problems
- Local polyhedra and geometric graphs
- Approximate unions of lines and Minkowski sums
- Can visibility graphs be represented compactly?
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Segment proximity graphs and nearest neighbor queries amid disjoint segments
- Bipartite diameter and other measures under translation
- Finding simplices containing the origin in two and three dimensions
- Finding pairwise intersections inside a query range
- On k-enclosing slab problems
- Searching edges in the overlap of two plane graphs
- scientific article; zbMATH DE number 1786518 (Why is no real title available?)
- Semialgebraic range stabbing, ray shooting, and intersection counting in the plane
- Geometric matching and bottleneck problems
- Semi-algebraic off-line range searching and biclique partitions in the plane
- External-memory algorithms for processing line segments in geographic information systems
- Counting and cutting cycles of lines and rods in space
- Data structures for extension violations in a query range
- Partitioning arrangements of lines. II: Applications
- Reporting bichromatic segment intersections from point sets
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Diameter, width, closest line pair, and parametric searching
This page was built for publication: Algorithms for bichromatic line-segment problems and polyhedral terrains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314429)
