Diameter partitioning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3368644 (Why is no real title available?)
- scientific article; zbMATH DE number 3407703 (Why is no real title available?)
- Algorithms for high dimensional stabbing problems
- Non-partitionable point sets
- On the number of line separations of a finite set in the plane
- Optimal packing and covering in the plane are NP-complete
- Polygon Retrieval
- Space searching for intersecting objects
- Stabbing line segments
- The NP-completeness column: An ongoing guide
Cited in
(17)- A novel dynamic minimum spanning tree based clustering method for image mining
- New algorithms for \(k\)-center and extensions
- New Algorithms for k-Center and Extensions
- OPTIMAL LINE BIPARTITIONS OF POINT SETS
- On the partition of plane sets into 6 subsets of small diameter
- EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*
- A parallel algorithm for partitioning a point set to minimize the maximum of diameters
- Free-form surface partition in 3-d
- Optimal line bipartitions of point sets
- Computing grasp functions
- Duality Relationships for a Partitioning Problem
- Algorithms for high dimensional stabbing problems
- Computing Euclidean maximum spanning trees
- Minimizing the sum of diameters efficiently
- Polyhedral line transversals in space
- Geometric clustering in normed planes
- Some clustering algorithms in normed planes
This page was built for publication: Diameter partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1076974)
