Computational Geometric Approaches to Equitable Districting: A Survey

Mehdi Behroozi () and John Gunnar Carlsson ()
Additional contact information
Mehdi Behroozi: Northeastern University
John Gunnar Carlsson: University of Southern California

Chapter Chapter 4 in Optimal Districting and Territory Design, 2020, pp 57-74 from Springer

Abstract: Abstract Dividing a piece of land into sub-regions is a natural problem that belongs to many different domains within the world of operations research. There are many different tools that one can use to solve such problems, such as infinite-dimensional optimization, integer programming, or graph theoretic models. In this chapter, we summarize previous methods for solving districting problems that use computational geometry.

Keywords: Computational geometry; Ham sandwich; Equitable partition; Districting; Convex partition; Discrete geometry; Voronoi diagram; Power diagram (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-3-030-34312-5_4

Ordering information: This item can be ordered from
http://www.springer.com/9783030343125

DOI: 10.1007/978-3-030-34312-5_4

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().