Diameter partitioning

DOI10.1007/BF02187699zbMath0594.52003OpenAlexW2913408406MaRDI QIDQ1076974

David Avis

Publication date: 1986

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/130994

zbMATH Keywords

algorithmdiameterpartition of point sets

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

A novel dynamic minimum spanning tree based clustering method for image mining ⋮ Geometric clustering in normed planes ⋮ New algorithms for \(k\)-center and extensions ⋮ Computing grasp functions ⋮ Computing Euclidean maximum spanning trees ⋮ Algorithms for high dimensional stabbing problems ⋮ FREE-FORM SURFACE PARTITION IN 3-D ⋮ EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS* ⋮ Some clustering algorithms in normed planes ⋮ Polyhedral line transversals in space ⋮ New Algorithms for k-Center and Extensions ⋮ OPTIMAL LINE BIPARTITIONS OF POINT SETS

Cites Work

• Algorithms for high dimensional stabbing problems
• Non-partitionable point sets
• Optimal packing and covering in the plane are NP-complete
• Stabbing line segments
• On the number of line separations of a finite set in the plane
• Polygon Retrieval
• Space searching for intersecting objects
• The NP-completeness column: An ongoing guide
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item