Geometric clustering for the consolidation of farmland and woodland
From MaRDI portal
Publication:483564
DOI10.1007/s00283-014-9448-2zbMath1401.52025OpenAlexW2067260519MaRDI QIDQ483564
Peter Gritzmann, Andreas Brieden, Steffen Borgwardt
Publication date: 17 December 2014
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00283-014-9448-2
Clustering in the social and behavioral sciences (91C20) Computational aspects related to convexity (52B55) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Sustainable operations, An exact algorithm for semi-supervised minimum sum-of-squares clustering, Power diagram detection with applications to information elicitation, Collaboration and optimization in farmland exchanges, On three soft rectangle packing problems with guillotine constraints, An LP-based \(k\)-means algorithm for balancing weighted point sets, Constrained clustering via diagrams: a unified theory and its application to electoral district design, Constructing Clustering Transformations, Efficient solutions for weight-balanced partitioning problems, Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the diameter of partition polytopes and vertex-disjoint cycle cover
- On clustering bodies: geometry and polyhedral approximation
- Optimal partitions having disjoint convex and conic hulls
- Minkowski-type theorems and least-squares clustering
- Constrained minimum-\(k\)-star clustering and its application to the consolidation of farmland
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem
- On Optimal Weighted Balanced Clusterings: Gravity Bodies and Power Diagrams
- Deterministic and randomized polynomial‐time approximation of radii
- Power Diagrams: Properties, Algorithms and Applications