101,413 research outputs found
Path, theme and narrative in open plan exhibition settings
Three arguments are made based on the analysis of science exhibitions. First,sufficiently refined techniques of spatial analysis allow us to model the impact oflayout upon visitors' paths, even in moderately sized open plans which allow almostrandom patterns of movement and relatively unobstructed visibility. Second, newlydeveloped or adapted techniques of analysis allow us to make a transition frommodeling the mechanics of spatial movement (the way in which movement is affectedby the distribution of obstacles and boundaries), to modeling the manner in whichmovement might register additional aspects of visual information. Third, theadvantages of such purely spatial modes of analysis extend into providing us with asharper understanding of some of the pragmatic constrains within which exhibitioncontent is conceived and designed
On Vertex- and Empty-Ply Proximity Drawings
We initiate the study of the vertex-ply of straight-line drawings, as a
relaxation of the recently introduced ply number. Consider the disks centered
at each vertex with radius equal to half the length of the longest edge
incident to the vertex. The vertex-ply of a drawing is determined by the vertex
covered by the maximum number of disks. The main motivation for considering
this relaxation is to relate the concept of ply to proximity drawings. In fact,
if we interpret the set of disks as proximity regions, a drawing with
vertex-ply number 1 can be seen as a weak proximity drawing, which we call
empty-ply drawing. We show non-trivial relationships between the ply number and
the vertex-ply number. Then, we focus on empty-ply drawings, proving some
properties and studying what classes of graphs admit such drawings. Finally, we
prove a lower bound on the ply and the vertex-ply of planar drawings.Comment: Appears in the Proceedings of the 25th International Symposium on
Graph Drawing and Network Visualization (GD 2017
Reformulating Space Syntax: The Automatic Definition and Generation of Axial Lines and Axial Maps
Space syntax is a technique for measuring the relative accessibility of different locations in a spatial system which has been loosely partitioned into convex spaces.These spaces are approximated by straight lines, called axial lines, and the topological graph associated with their intersection is used to generate indices of distance, called integration, which are then used as proxies for accessibility. The most controversial problem in applying the technique involves the definition of these lines. There is no unique method for their generation, hence different users generate different sets of lines for the same application. In this paper, we explore this problem, arguing that to make progress, there need to be unambiguous, agreed procedures for generating such maps. The methods we suggest for generating such lines depend on defining viewsheds, called isovists, which can be approximated by their maximum diameters,these lengths being used to form axial maps similar to those used in space syntax. We propose a generic algorithm for sorting isovists according to various measures,approximating them by their diameters and using the axial map as a summary of the extent to which isovists overlap (intersect) and are accessible to one another. We examine the fields created by these viewsheds and the statistical properties of the maps created. We demonstrate our techniques for the small French town of Gassin used originally by Hillier and Hanson (1984) to illustrate the theory, exploring different criteria for sorting isovists, and different axial maps generated by changing the scale of resolution. This paper throws up as many problems as it solves but we believe it points the way to firmer foundations for space syntax
Space-efficient detection of unusual words
Detecting all the strings that occur in a text more frequently or less
frequently than expected according to an IID or a Markov model is a basic
problem in string mining, yet current algorithms are based on data structures
that are either space-inefficient or incur large slowdowns, and current
implementations cannot scale to genomes or metagenomes in practice. In this
paper we engineer an algorithm based on the suffix tree of a string to use just
a small data structure built on the Burrows-Wheeler transform, and a stack of
bits, where is the length of the string and
is the size of the alphabet. The size of the stack is except for very
large values of . We further improve the algorithm by removing its time
dependency on , by reporting only a subset of the maximal repeats and
of the minimal rare words of the string, and by detecting and scoring candidate
under-represented strings that in the string. Our
algorithms are practical and work directly on the BWT, thus they can be
immediately applied to a number of existing datasets that are available in this
form, returning this string mining problem to a manageable scale.Comment: arXiv admin note: text overlap with arXiv:1502.0637
- …