Visualizing Spatial Partitions

نویسندگان

  • Penny Rheingans
  • Blazej Bulka
  • Marie desJardins
چکیده

We describe an application of geospatial visualization and AI search techniques to the problem of school redistricting, in which students are assigned to home schools within a county or school district. This is a multicriteria optimization problem in which competing objectives must be considered, such as school capacity, busing costs, and socioeconomic distribution. Additionally, school assignments need to be made for three different levels (elementary, middle, and high school) in a way which allows children to move from one school to the next with a cohort of sufficient size. Because of the complexity of the decision-making problem, tools are needed to help end users generate, evaluate, and compare alternative school assignment plans. A key goal of our research is to aid users in finding multiple qualitatively different redistricting plans that represent different tradeoffs in the decision space. We present visualization techniques which can be used to visualize the quality of spatial partititioning plans, compare the alternatives presented by different plans, and understand the interrelationships of plans at different educational levels. We demonstrate these techniques on partitions created through both manual construction and intelligient search processes for the population data of the school district of Howard County, Maryland. 1998 ACM Subject Classification I.3.8 Applications of Computer Graphics, I.2.8 Problem Solving, Control Methods, and Search

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partition and Conquer

Although maps and partitions are ubiquitous in geographical information systems and spatial databases, there is only little work investigating their foundations. We give a rigorous definition for spatial partitions and propose partitions as a generic spatial data type that can be used to model arbitrary maps and to support spatial analysis. We identify a set of three powerful operations on part...

متن کامل

Tsallis Entropy and Conditional Tsallis Entropy of Fuzzy Partitions

The purpose of this study is to define the concepts of Tsallis entropy and conditional Tsallis entropy of fuzzy partitions and to obtain some results concerning this kind entropy. We show that the Tsallis entropy of fuzzy partitions has the subadditivity and concavity properties. We study this information measure under the refinement and zero mode subset relations. We check the chain rules for ...

متن کامل

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

Spatial Partition Graphs: A Graph Theoretic Model of Maps

The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for map geometries for use in spatial systems. In this paper, we consider a subclass of map geometries known as spatial partitions that are able to model maps containing region features. However, spatial partitions are defi...

متن کامل

Relational Data Analysis

Given a binary relation R, we look for partitions of its row set and its column set, respectively, that behave well with respect to selected algebraic properties, i.e., correspond to congruences related to R. Permutations are derived from these congruences that allow to rearrange R visualizing the decomposition.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011