Dispersing and grouping points on planar segments
From MaRDI portal
Publication:2232600
Recommendations
- Dispersing points on intervals
- Dispersing points on intervals
- Partitioning point sets in arbitrary dimension
- Partitioning point sets in space into disjoint convex polytopes
- Partitioning points by parallel planes
- scientific article; zbMATH DE number 3407703
- Separating point sets in polygonal environments
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Partitioning a planar point set into empty convex polygons
Cites work
- scientific article; zbMATH DE number 1182762 (Why is no real title available?)
- A study on two geometric location problems
- Algorithms – ESA 2005
- Approximation Guarantees for Max Sum and Max Min Facility Dispersion with Parameterised Triangle Inequality and Applications in Result Diversification
- Approximation algorithms for dispersion problems
- Approximation algorithms for maximum dispersion
- Dispersing points on intervals
- Dispersing points on intervals
- Farthest line segment Voronoi diagrams
- Heuristic and Special Case Algorithms for Dispersion Problems
- Local Search for Max-Sum Diversification
- Minimum diameter color-spanning sets revisited
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
- On some matching problems under the color-spanning model
- On the farthest line-segment Voronoi diagram
- On the parameterized complexity of multiple-interval graph problems
- Optimal binary space partitions for segments in the plane
- The Problem of Compatible Representatives
- Unit disk graphs
This page was built for publication: Dispersing and grouping points on planar segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2232600)
