Minimizing the sum of diameters efficiently

Computational Geometry: Theory and Applications

Volumn 2, Issue 2, 1992, Pages 111-118

  Hershberger, John ^a  

^a HEWLETT PACKARD COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38249008524     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/0925-7721(92)90028-Q     Document Type: Article

References (19)

1. A linear time algorithm for computing the Voronoi diagram of a convex polygon
2. Clustering algorithms based on minimum and maximum spanning trees
3. Decomposable searching problems I. Static-to-dynamic transformation
4. Geometric clusterings
5. An optimal algorithm for intersecting three-dimensional convex polyhedra
6. Maintenance of geometric extrema
7. Algorithms in Combinatorial Geometry
8. Optimal point location in a monotone subdivision
9. A linear-time algorithm for a special case of disjoint set union
10. Finding tailored partitions
11. The NP-completeness column
12. Efficient computation of continuous skeletons
13. Optimal search in planar subdivisions
14. On the complexity of some common geometric location problems
15. Partitioning points and graphs to minimize the maximum or the sum of diameters
16. The Design of Dynamic Data Structures
17. A worst-case algorithm for semi-online updates on decomposable problems