Diameter partitioning

descriptionPublicationkeyboard_double_arrow_right Article , Other literature type 01 Sep 1986 Germany English Publisher:Springer Science and Business Media LLCJournal:Discrete & Computational Geometry, volume 1, pages 265-276 (issn: 0179-5376, eissn: 1432-0444,

Copyright policy )

Authors: Avis, D.;

doi: 10.1007/bf02187699

Diameter partitioning

- Summary
- Subjects
- Metrics

Abstract

Given a set P of points, the diameter of P is the maximum distance of two points from P. In the paper, point sets are partitioned into two subsets satisfying certain requirements on the diameters, and cardinalities or displacement. The problems investigated about such partitions have algorithmic character.

Country

Germany

Related Organizations

McGill University
Canada
DigiZeitschriften
Germany

Keywords

510.mathematics, algorithm, Software, source code, etc. for problems pertaining to convex and discrete geometry, partition of point sets, Convex sets in \(2\) dimensions (including convex curves), diameter, Article

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	27
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%