121 research outputs found
Optimal design of spatial distribution networks
We consider the problem of constructing public facilities, such as hospitals,
airports, or malls, in a country with a non-uniform population density, such
that the average distance from a person's home to the nearest facility is
minimized. Approximate analytic arguments suggest that the optimal distribution
of facilities should have a density that increases with population density, but
does so slower than linearly, as the two-thirds power. This result is confirmed
numerically for the particular case of the United States with recent population
data using two independent methods, one a straightforward regression analysis,
the other based on density dependent map projections. We also consider
strategies for linking the facilities to form a spatial network, such as a
network of flights between airports, so that the combined cost of maintenance
of and travel on the network is minimized. We show specific examples of such
optimal networks for the case of the United States.Comment: 6 pages, 5 figure
Density-equalizing maps for simply-connected open surfaces
In this paper, we are concerned with the problem of creating flattening maps
of simply-connected open surfaces in . Using a natural principle
of density diffusion in physics, we propose an effective algorithm for
computing density-equalizing flattening maps with any prescribed density
distribution. By varying the initial density distribution, a large variety of
mappings with different properties can be achieved. For instance,
area-preserving parameterizations of simply-connected open surfaces can be
easily computed. Experimental results are presented to demonstrate the
effectiveness of our proposed method. Applications to data visualization and
surface remeshing are explored
Area-Universal Rectangular Layouts
A rectangular layout is a partition of a rectangle into a finite set of
interior-disjoint rectangles. Rectangular layouts appear in various
applications: as rectangular cartograms in cartography, as floorplans in
building architecture and VLSI design, and as graph drawings. Often areas are
associated with the rectangles of a rectangular layout and it might hence be
desirable if one rectangular layout can represent several area assignments. A
layout is area-universal if any assignment of areas to rectangles can be
realized by a combinatorially equivalent rectangular layout. We identify a
simple necessary and sufficient condition for a rectangular layout to be
area-universal: a rectangular layout is area-universal if and only if it is
one-sided. More generally, given any rectangular layout L and any assignment of
areas to its regions, we show that there can be at most one layout (up to
horizontal and vertical scaling) which is combinatorially equivalent to L and
achieves a given area assignment. We also investigate similar questions for
perimeter assignments. The adjacency requirements for the rectangles of a
rectangular layout can be specified in various ways, most commonly via the dual
graph of the layout. We show how to find an area-universal layout for a given
set of adjacency requirements whenever such a layout exists.Comment: 19 pages, 16 figure
Orientation-Constrained Rectangular Layouts
We construct partitions of rectangles into smaller rectangles from an input
consisting of a planar dual graph of the layout together with restrictions on
the orientations of edges and junctions of the layout. Such an
orientation-constrained layout, if it exists, may be constructed in polynomial
time, and all orientation-constrained layouts may be listed in polynomial time
per layout.Comment: To appear at Algorithms and Data Structures Symposium, Banff, Canada,
August 2009. 12 pages, 5 figure
Optimization-Based Construction of Quadrilateral Table Cartograms
A quadrilateral table cartogram is a rectangle-shaped figure that visualizes table-form data; quadrilateral cells in a table cartogram are transformed to express the magnitude of positive weights by their areas, while maintaining the adjacency of cells in the original table. However, the previous construction method is difficult to implement because it consists of multiple operations that do not have a unique solution and require complex settings to obtain the desired outputs. In this article, we propose a new construction for quadrilateral table cartograms by recasting the construction as an optimization problem. The proposed method is formulated as a simple minimization problem to achieve mathematical clarity. It can generate quadrilateral table cartograms with smaller deformation of rows and columns, thereby aiding readers to recognize the correspondence between table cartograms and original tables. In addition, we also propose a means of sorting rows and/or columns prior to the construction of table cartograms to reduce excess shape deformation. Applications of the proposed method confirm its capability to output table cartograms that clearly visualize the characteristics of datasets
Recognizing Weighted Disk Contact Graphs
Disk contact representations realize graphs by mapping vertices bijectively
to interior-disjoint disks in the plane such that two disks touch each other if
and only if the corresponding vertices are adjacent in the graph. Deciding
whether a vertex-weighted planar graph can be realized such that the disks'
radii coincide with the vertex weights is known to be NP-hard. In this work, we
reduce the gap between hardness and tractability by analyzing the problem for
special graph classes. We show that it remains NP-hard for outerplanar graphs
with unit weights and for stars with arbitrary weights, strengthening the
previous hardness results. On the positive side, we present constructive
linear-time recognition algorithms for caterpillars with unit weights and for
embedded stars with arbitrary weights.Comment: 24 pages, 21 figures, extended version of a paper to appear at the
International Symposium on Graph Drawing and Network Visualization (GD) 201
Computational Chemistry in Rational Material Design for Organic Photovoltaics
The acceleration in global population growth, combined with worldwide economic development, have together dramatically increased the demand for energy. This demand has been filled by fossil fuels. The reliance on fossil fuels as a cheap and convenient means of energy is leading to adverse, and perhaps irreversible, ramifications for the entire planet. Many potential alternative energy sources have been explored to alleviate the dependence upon fossil fuels. The use of solar energy as a renewable energy source has been a key area of investigation to many scientists and engineers looking to solve this problem. Among current solar cell design paradigms, organic photovoltaic cell technology shows significant potential due to its potential low cost, flexibility, and manipulability. While scientific research has led to progress in organic photovoltaics, significant issues remain that must be addressed in order for organic photovoltaic cells to become a more feasible option. The purpose of this paper is to expound the crucial role of computational chemistry in novel material discovery and optimization as it pertains to organic photovoltaics
- …