Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...

lines, pseudolines, polar coordinates, trilinear coordinates, non-linear programming, geometry We present a graph-drawing algorithm which respects extended co-linearity constraints. These are expressed as a set of ‘straight’ paths in a planar graph. Constraints of this sort are translated into a set of inequalities over polar coordinates of lines. These inequalities provide necessary and suffic...

We present a simple algorithm for computing straight skeletons of planar straight-line graphs. We exploit the relation between motorcycle graphs and straight skeletons, and introduce a wavefront-propagation algorithm that circumvents the expensive search for the next split event. Our algorithm maintains the simplicity of the triangulation-based algorithm by Aichholzer and Aurenhammer but has a ...

Straight-through-processing (STP) is an emerging IT-based innovation for financial services that redefines the way organizations can exchange business-critical information without manual intervention during the transaction lifecycle. While some progress has been made in understanding STP phenomena, few empirical studies have examined how STP innovation is adopted and diffused across organizatio...

In this paper, we investigate planar upward straight-line grid drawing problems for bounded-degree rooted trees so that a drawing takes up as little area as possible. A planar upward straight-line grid tree drawing satisses the following four constraints: (1) all vertices are placed at distinct grid points (grid), (2) all edges are drawn as straight lines (straight-line), (3) no two edges in th...