We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n; 2), i.e., B(n; 2) = B (n; 2). Mathematics Subject Classi cations (1991). 06A06, 51G05,...
In the quest for an elegant formulation of the notion of "polycategory" we develop a more symmetric counterpart to Burroni's notion of "T-category", where ...
Abstract This paper deals with automating the drawing of subway maps. There are two features of schematic subway maps that make them different from drawings of other networks such...
We present kinetic data structures for detecting collisions between a set of polygons that are moving continuously. Unlike classical collision detection methods that rely on bound...
Pankaj K. Agarwal, Julien Basch, Leonidas J. Guiba...
The recursive least-squares (RLS) algorithm is one of the most well-known algorithms used in adaptive filtering, system identification and adaptive control. Its popularity is main...