|
Proximity Analysis
Proximity analysis is a class of spatial analysis tools and algorithms that employ geographic distance as a central principle.Blinn, Charles R., Lloyd P. Queen, and Les W. Maki, "Geographic Information Systems: A Glossary."'' Proximity analysis is a crucial tool for business marketing and site selection. Marketers analyze demographics and infrastructure to determine trade areas. Trade areas are continuous geographic areas around a site that generate the majority of revenue. Proximity Analysis is a study using location intelligence, mapping software, to calculate the distances between customer/prospect locations, to your location(s) (retail store, bank, restaurant, dealer, or sales reps) as the first step in building an understanding of trade/sales/service area(s). An analysis typically includes a report and map showing the relationship of the data and often includes competitor locations in the analysis. Techniques There are a variety of tools, models, and algorithms that incorp ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spatial Analysis
Spatial analysis or spatial statistics includes any of the formal techniques which studies entities using their topological, geometric, or geographic properties. Spatial analysis includes a variety of techniques, many still in their early development, using different analytic approaches and applied in fields as diverse as astronomy, with its studies of the placement of galaxies in the cosmos, to chip fabrication engineering, with its use of "place and route" algorithms to build complex wiring structures. In a more restricted sense, spatial analysis is the technique applied to structures at the human scale, most notably in the analysis of geographic data or transcriptomics data. Complex issues arise in spatial analysis, many of which are neither clearly defined nor completely resolved, but form the basis for current research. The most fundamental of these is the problem of defining the spatial location of the entities being studied. Classification of the techniques of spatial ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance Decay
Distance decay is a geographical term which describes the effect of distance on cultural or spatial interactions. The distance decay effect states that the interaction between two locales declines as the distance between them increases. Once the distance is outside of the two locales' activity space, their interactions begin to decrease. It is thus an assertion that the mathematics of the inverse square law in physics can be applied to many geographic phenomena, and is one of the ways in which physics principles such as gravity are often applied metaphorically to geographic situations. Mathematical models Distance decay is graphically represented by a curving line that swoops concavely downward as distance along the x-axis increases. Distance decay can be mathematically represented as an inverse-square law by the expression I = const. \times d^ or I \propto 1/d^2, where is interaction and is distance. In practice, it is often parameterized to fit a specific situation, such ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dijkstra's Algorithm
Dijkstra's algorithm ( ) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants. Dijkstra's original algorithm found the shortest path between two given nodes, but a more common variant fixes a single node as the "source" node and finds shortest paths from the source to all other nodes in the graph, producing a shortest-path tree. For a given source node in the graph, the algorithm finds the shortest path between that node and every other. It can also be used for finding the shortest paths from a single node to a single destination node by stopping the algorithm once the shortest path to the destination node has been determined. For example, if the nodes of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a dir ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Transport Network Analysis
A transport network, or transportation network, is a network or graph in geographic space, describing an infrastructure that permits and constrains movement or flow. Examples include but are not limited to road networks, railways, air routes, pipelines, aqueducts, and power lines. The digital representation of these networks, and the methods for their analysis, is a core part of spatial analysis, geographic information systems, public utilities, and transport engineering. Network analysis is an application of the theories and algorithms of graph theory and is a form of proximity analysis. History The applicability of graph theory to geographic phenomena was recognized as an early date. In fact, many of the early problems and theories undertaken by graph theorists were inspired by geographic situations, such as the Seven Bridges of Königsberg problem, which was one of the original foundations of graph theory when it was solved by Leonhard Euler in 1736. In the 1970s, the co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dijkstra Animation
Dijkstra ( or ) is a Dutch family name of West Frisian origin. It most commonly refers to: * Edsger W. Dijkstra (1930–2002), Dutch computer scientist ** Named after him: Dijkstra's algorithm, Dijkstra Prize, Dijkstra–Scholten algorithm Dijkstra may also refer to: People * Bram Dijkstra (born 1938), American professor of English literature and cultural historian * Jan Dijkstra (1910–1993), Dutch mayor * (1896–1978), Dutch painter, illustrator and stained glass artist * Lenie Dijkstra (born 1967), Dutch racing cyclist * Lou Dijkstra (1909-1964), Dutch speed skater, father of Sjoukje Dijkstra * Margaret Dijkstra, pseudonym of Eva Gerlach (born 1948), Dutch poet * Marjolein Dijkstra (born 1967), Dutch physicist * Mart Dijkstra (born 1990), Dutch footballer * Meindert Dijkstra (born 1967), Dutch footballer * Peter Dijkstra (born 1978), Dutch choir conductor * Pia Dijkstra (born 1954), Dutch politician and television presenter * Remco Dijkstra (born 1972), Dutch politici ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Distance Matrix
In mathematics, computer science and especially graph theory, a distance matrix is a square matrix (two-dimensional array) containing the distances, taken pairwise, between the elements of a set. Depending upon the application involved, the ''distance'' being used to define this matrix may or may not be a metric. If there are elements, this matrix will have size . In graph-theoretic applications the elements are more often referred to as points, nodes or vertices. Non-metric distance matrix In general, a distance matrix is a weighted adjacency matrix of some graph. In a network, a directed graph with weights assigned to the arcs, the distance between two nodes of the network can be defined as the minimum of the sums of the weights on the shortest paths joining the two nodes. This distance function, while well defined, is not a metric. There need be no restrictions on the weights other than the need to be able to combine and compare them, so negative weights are used in some appli ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lloyd's Algorithm
In electrical engineering and computer science, Lloyd's algorithm, also known as Voronoi iteration or relaxation, is an algorithm named after Stuart P. Lloyd for finding evenly spaced sets of points in subsets of Euclidean spaces and partitions of these subsets into well-shaped and uniformly sized convex cells. Like the closely related ''k''-means clustering algorithm, it repeatedly finds the centroid of each set in the partition and then re-partitions the input according to which of these centroids is closest. In this setting, the mean operation is an integral over a region of space, and the nearest centroid operation results in Voronoi diagrams. Although the algorithm may be applied most directly to the Euclidean plane, similar algorithms may also be applied to higher-dimensional spaces or to spaces with other non-Euclidean metrics. Lloyd's algorithm can be used to construct close approximations to centroidal Voronoi tessellations of the input, which can be used for quantizati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Facility Location Problem is the problem of how to share the co ...
A facility location problem is the problem of deciding where a given public facility (e.g. a school or a power station) should be placed. This problem has been studied from various angles. * Optimal facility location is an optimization problem: deciding where to place the facility in order to minimize transportation costs while considering factors like avoiding placing hazardous materials near housing. * Facility location (competitive game) is a problem in game theory: finding an equilbrium in a game in which the players are different producers, each of which looks for a location for placing a facility in order to attract as many consumers as possible. * Facility location (cooperative game) The cooperative facility location game is a cooperative game of cost sharing. The goal is to share the cost of opening new facilities between the clients enjoying these facilities.Kamal Jain and Mohammad Mahdian, "Cost Sharing". Chapter 15 in The g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gravity Model
Gravity models are used in various social sciences to predict and describe certain behaviors that mimic gravitational interaction as described in Isaac Newton's laws of gravity. Generally, the social science models contain some elements of mass and distance, which lends them to the metaphor of physical gravity. A gravity model provides an estimate of the volume of flows of, for example, goods, services, or people between two or more locations. This could be the movement of people between cities or the volume of trade between countries. A gravity model cannot accurately predict flows, but is instead a measure against which actual observed values can be compared, highlighting where those flows are unexpectedly high or low. Social science gravity models: *Gravity model of trade *Trip distribution *Gravity model of migration *Two-step floating catchment area (2SFCA) method The two-step floating catchment area (2SFCA) method is a method for combining a number of related types of infor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Inverse Square Law
In science, an inverse-square law is any scientific law stating that a specified physical quantity is inversely proportional to the square of the distance from the source of that physical quantity. The fundamental cause for this can be understood as geometric dilution corresponding to point-source radiation into three-dimensional space. Radar energy expands during both the signal transmission and the reflected return, so the inverse square for both paths means that the radar will receive energy according to the inverse fourth power of the range. To prevent dilution of energy while propagating a signal, certain methods can be used such as a waveguide, which acts like a canal does for water, or how a gun barrel restricts hot gas expansion to one dimension in order to prevent loss of energy transfer to a bullet. Formula In mathematical notation the inverse square law can be expressed as an intensity (I) varying as a function of distance (d) from some centre. The intensity is pr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Voronoi Diagram
In mathematics, a Voronoi diagram is a partition of a plane into regions close to each of a given set of objects. In the simplest case, these objects are just finitely many points in the plane (called seeds, sites, or generators). For each seed there is a corresponding region, called a Voronoi cell, consisting of all points of the plane closer to that seed than to any other. The Voronoi diagram of a set of points is dual to that set's Delaunay triangulation. The Voronoi diagram is named after mathematician Georgy Voronoy, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav Lejeune Dirichlet). Voronoi cells are also known as Thiessen polygons. Voronoi diagrams have practical and theoretical applications in many fields, mainly in science and technology, but also in visual art. The simplest case In the simplest case, shown in the first picture, we are given a finite set of points in the Euclidean p ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Site Selection
The award-winning ''Site Selection'' magazine, published by Conway Data, Inc., is the official publication of thIndustrial Asset Management Council(IAMC). The magazine delivers expansion planning information to over 44,000 readers including corporate executives, site selection consultants, and real estate professionals. ''Site Selection'' is available in a bimonthly print magazine, or on their web site. The magazine is headquartered in Norcross, Georgia. Staff Publication staff includes Adam Jones-Kelley, President; Sean Laughlin, Chief Operating Officer; Ron Starner, Senior Vice President; Mark Arend, Editor-in-Chief; Adam Bruns, Managing Editor; Gary Daughters, Senior Editor History ''Site Selection'' dates back to 1883, with the ''Manufacturers Record'' of Baltimore. It was the top business journal of its day, with information about new plants and business expansions well into the 20th century. During the 1950sMcKinley Conway purchased ''Manufacturers Record'' from the foun ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
