167,051 research outputs found
From axial to road-centre lines: a new representation for space syntax and a new model of route choice for transport network analysis
Axial analysis is one of the fundamental components of space syntax. The space syntax community has suggested that it picks up qualities of configurational relationships between spaces not illuminated by other representations. However, critics have questioned the absolute necessity of axial lines to space syntax, as well as the exact definition of axial lines. Why not another representation? In particular, why not road-centre lines, which are easily available in many countries for use within geographical information systems? Here I propose that a recently introduced method of analysis, angular segment analysis, can marry axial and road-centre line representations, and in doing so reflect a cognitive model of how route choice decisions may be made. I show that angular segment analysis can be applied generally to road-centre line segments or axial segments, through a simple length-
weighted normalisation procedure that makes values between the two maps comparable. I make comparative quantitative assessments for a real urban system, not just investigating angular analysis between axial and road-centre line networks, but also including more intuitive measures based on metric (or block) distances between locations. I show that the new angular segment analysis algorithm produces better correlation with observed vehicular flow than both standard axial analysis and metric distance measures. The results imply that there is no reason why space syntax inspired measures cannot be combined with transportation network analysis representations in order to create a new, cognitively coherent, model of movement in the city
Vacuum energy, spectral determinant and heat kernel asymptotics of graph Laplacians with general vertex matching conditions
We consider Laplace operators on metric graphs, networks of one-dimensional
line segments (bonds), with matching conditions at the vertices that make the
operator self-adjoint. Such quantum graphs provide a simple model of quantum
mechanics in a classically chaotic system with multiple scales corresponding to
the lengths of the bonds. For graph Laplacians we briefly report results for
the spectral determinant, vacuum energy and heat kernel asymptotics of general
graphs in terms of the vertex matching conditions.Comment: 5 pages, submitted to proceedings of QFEXT09, minor corrections made
Isotropic covariance functions on graphs and their edges
We develop parametric classes of covariance functions on linear networks and
their extension to graphs with Euclidean edges, i.e., graphs with edges viewed
as line segments or more general sets with a coordinate system allowing us to
consider points on the graph which are vertices or points on an edge. Our
covariance functions are defined on the vertices and edge points of these
graphs and are isotropic in the sense that they depend only on the geodesic
distance or on a new metric called the resistance metric (which extends the
classical resistance metric developed in electrical network theory on the
vertices of a graph to the continuum of edge points). We discuss the advantages
of using the resistance metric in comparison with the geodesic metric as well
as the restrictions these metrics impose on the investigated covariance
functions. In particular, many of the commonly used isotropic covariance
functions in the spatial statistics literature (the power exponential,
Mat{\'e}rn, generalized Cauchy, and Dagum classes) are shown to be valid with
respect to the resistance metric for any graph with Euclidean edges, whilst
they are only valid with respect to the geodesic metric in more special cases.Comment: 6 figures, 1 tabl
Voronoi diagrams in the max-norm: algorithms, implementation, and applications
Voronoi diagrams and their numerous variants are well-established objects in computational geometry. They have proven to be extremely useful to tackle geometric problems in various domains such as VLSI CAD, Computer Graphics, Pattern Recognition, Information Retrieval, etc. In this dissertation, we study generalized Voronoi diagram of line segments as motivated by applications in VLSI Computer Aided Design. Our work has three directions: algorithms, implementation, and applications of the line-segment Voronoi diagrams. Our results are as follows: (1) Algorithms for the farthest Voronoi diagram of line segments in the Lp metric, 1 ≤ p ≤ ∞. Our main interest is the L2 (Euclidean) and the L∞ metric. We first introduce the farthest line-segment hull and its Gaussian map to characterize the regions of the farthest line-segment Voronoi diagram at infinity. We then adapt well-known techniques for the construction of a convex hull to compute the farthest line-segment hull, and therefore, the farthest segment Voronoi diagram. Our approach unifies techniques to compute farthest Voronoi diagrams for points and line segments. (2) The implementation of the L∞ Voronoi diagram of line segments in the Computational Geometry Algorithms Library (CGAL). Our software (approximately 17K lines of C++ code) is built on top of the existing CGAL package on the L2 (Euclidean) Voronoi diagram of line segments. It is accepted and integrated in the upcoming version of the library CGAL-4.7 and will be released in september 2015. We performed the implementation in the L∞ metric because we target applications in VLSI design, where shapes are predominantly rectilinear, and the L∞ segment Voronoi diagram is computationally simpler. (3) The application of our Voronoi software to tackle proximity-related problems in VLSI pattern analysis. In particular, we use the Voronoi diagram to identify critical locations in patterns of VLSI layout, which can be faulty during the printing process of a VLSI chip. We present experiments involving layout pieces that were provided by IBM Research, Zurich. Our Voronoi-based method was able to find all problematic locations in the provided layout pieces, very fast, and without any manual intervention
From Random Lines to Metric Spaces
Consider an improper Poisson line process, marked by positive speeds so as to
satisfy a scale-invariance property (actually, scale-equivariance). The line
process can be characterized by its intensity measure, which belongs to a
one-parameter family if scale and Euclidean invariance are required. This paper
investigates a proposal by Aldous, namely that the line process could be used
to produce a scale-invariant random spatial network (SIRSN) by means of
connecting up points using paths which follow segments from the line process at
the stipulated speeds. It is shown that this does indeed produce a
scale-invariant network, under suitable conditions on the parameter; indeed
that this produces a parameter-dependent random geodesic metric for
d-dimensional space (), where geodesics are given by minimum-time
paths. Moreover in the planar case it is shown that the resulting geodesic
metric space has an almost-everywhere-unique-geodesic property, that geodesics
are locally of finite mean length, and that if an independent Poisson point
process is connected up by such geodesics then the resulting network places
finite length in each compact region. It is an open question whether the result
is a SIRSN (in Aldous' sense; so placing finite mean length in each compact
region), but it may be called a pre-SIRSN.Comment: Version 1: 46 pages, 10 figures Version 2: 47 pages, 10 figures
(various typos and stylistic amendments, added dedication to Burkholder,
added references concerning Lipschitz property and Sobolev space
Robust integral image rectification framework using perspective transformation supported by statistical line segment clustering
In most integral image analysis and processing tasks, accurate knowledge of the internal image structure is required. In this paper we present a robust framework for the accurate rectification of perspectively distorted integral images based on multiple line segment detection. The use of multiple line segments increases the overall fault tolerance of our framework providing strong statistical support for the rectification process. The proposed framework is used for the automatic rectification, metric correction, and rotation of distorted integral images. The performance of our framework is assessed over a number of integral images with varying scene complexity and noise levels
- …