Minimum Cell Connection in Line Segment Arrangements
From MaRDI portal
(Redirected from Publication:3132917)
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)
Recommendations
- Minimum area joining of k compacted cells
- Minimum linear arrangements
- On cellular straight line segments
- Minimum connected dominating sets of intervals on lines
- Minimal coupled cell networks
- Cell-paths in mono- and bichromatic line arrangements in the plane
- Minimum spanning tree of line segments
- Minimum Linear Arrangement of Series-Parallel Graphs
Cites work
- scientific article; zbMATH DE number 739017 (Why is no real title available?)
- scientific article; zbMATH DE number 2147947 (Why is no real title available?)
- A polynomial-time algorithm for computing the resilience of arrangements of ray sensors
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Approximation algorithms and hardness results for labeled connectivity problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Improved algorithms for feedback vertex set problems
- On grid intersection graphs
- On lazy randomized incremental construction
- On the complexity of barrier resilience for fat regions
- On the general motion-planning problem with two degrees of freedom
- Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
- Ray shooting in polygons using geodesic triangulations
- Some optimal inapproximability results
- Testing homotopy for paths in the plane
- The Number of Shortest Paths on the Surface of a Polyhedron
- The parameterized complexity of some minimum label problems
Cited in
(8)- Exact and Approximate Algorithms for Computing a Second Hamiltonian Cycle
- The complexity of separating points in the plane
- Minimum cuts in geometric intersection graphs
- Hardness of minimum barrier shrinkage and minimum installation path
- Minimal coupled cell networks
- Extremal problems on ray sensor configurations
- Enclosing points with geometric objects
- How to navigate through obstacles?
This page was built for publication: Minimum Cell Connection in Line Segment Arrangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132917)
