Algorithms for bichromatic line-segment problems and polyhedral terrains
From MaRDI portal
Publication:1314429
DOI10.1007/BF01182771zbMATH Open0818.68140MaRDI QIDQ1314429FDOQ1314429
Authors: Bernard Chazelle, Herbert Edelsbrunner, Leonidas Guibas, Micha Sharir 
Publication date: 20 August 1995
Published in: Algorithmica (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- An optimal algorithm for intersecting line segments in the plane
- Optimal Point Location in a Monotone Subdivision
- An Optimal-Time Algorithm for Slope Selection
- Fractional cascading. I: A data structuring technique
- Cutting hyperplanes for divide-and-conquer
- Lines in space: Combinatorics and algorithms
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- An algorithm for generalized point location and its applications
- Reporting and counting segment intersections
- Title not available (Why is that?)
- Computing convolutions by reciprocal search
- The shortest watchtower and related problems for polyhedral terrains
- Rectilinear line segment intersection, layered segment trees, and dynamization
Cited In (32)
- Polynomial time algorithms for bichromatic problems
- On the number of regular vertices of the union of Jordan regions
- Finding a largest-area triangle in a terrain in near-linear time
- 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
- Title not available (Why is that?)
- On counting pairs of intersecting segments and off-line triangle range searching
- 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
- On ray shooting for triangles in 3-space and related problems
- Region-restricted clustering for geographic data mining
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
- On lines missing polyhedral sets in 3-space
- 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
- Bipartite diameter and other measures under translation
- Finding simplices containing the origin in two and three dimensions
- Finding pairwise intersections inside a query range
- Searching edges in the overlap of two plane graphs
- Title not available (Why is that?)
- 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
- Reporting bichromatic segment intersections from point sets
- Partitioning arrangements of lines. II: Applications
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Placing Text Boxes on Graphs
- 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)
