The Setting
A slope sweep follows the lowest projected points through successive exchanges. Convex graph families give a continuous version of vertical rank, and dyadic time windows index the resulting labels.
A planar point is a pair of real numbers.✦ An -point configuration is an indexed map . A configuration is in general position if its points are distinct and for distinct indices ; this determinant is their orientation. A generic configuration is a configuration in general position with distinct horizontal coordinates and distinct slopes for distinct unordered pairs , such that no intersection of the open segments of two distinct unordered pairs lies on the closed segment of a third distinct unordered pair.✦
The sweep projection at slope is .✦ A slope separates a marked index set when for and .✦ A uniform exchange system consists of sample slopes and marked sets satisfying (1); it has batches, rank and exchange distance . (1)✦ The leaving and entering sets of batch are and . The exchange graph has edge set ✦ and vertex set consisting of their endpoints.✦ A consecutive batch window of is the system obtained by restricting its stages to , where .✦
Exchange Graphs and Convex Families
For a batch with leaving set , entering set and exchange distance , enumerations and define the cyclic perfect matching for each .✦ The leaving and entering point enumerations apply this construction to each batch, giving its th perfect matching. A matching between the differences of two finite marked sets induces a bijection between those sets by fixing their shared points and matching the others.✦ The batch token transport is the bijection that fixes the shared points of the two marked sets and matches their remaining points by the th batch matching.✦ The cumulative token transport is the bijection obtained by starting with the identity and successively composing the batch token transports.✦
An edge token trace for consists of a batch, a matching index and an initial token with and .✦ The convex chain owner of an exchange edge is the pair from its chosen edge token trace; its initial token is regarded as a point index.✦
A straight-line drawing of is a finite vertex set and a finite set of ordered edges, each directed toward the larger horizontal coordinate and with both endpoints in the vertex set.✦ The exchange graph drawing uses and .✦ Two edges have an interior intersection when their open endpoint segments intersect.✦ The crossing edge pairs of a drawing are the unordered pairs of edges whose open endpoint segments intersect✦, and a chosen crossing point is a point in the corresponding intersection.✦ For a drawing and a finite edge set on the same configuration, the exterior edge crossing points relative to form the finite set of chosen crossing points of lying on none of the closed segments specified by .✦
A convex graph family consists of continuous convex functions , indexed by , and a positive scale .✦ The flat family in is the convex graph family with and scale .✦ For and a finite set , convex chain graph extensions of are continuous convex graphs with secant slopes between constants . Every exchange segment lies on the graph indexed by its convex chain owner. A point of on one of the graphs must lie on an exchange segment owned by that graph.
Slope Bounds and Vertical Levels
The vertical graph rank of a point in a finite graph family is the number .✦ The open unit interval is .✦ A slope-bounded rank coordinate is a continuous function whose restriction to each vertical line is strictly increasing and onto , and which satisfies (2). (2)✦ The rank level height , for , is the unique height with .✦ For and , the rank level height difference at is the function given by .✦
The Definition
Definition 1 (Window families and rank coordinates). The dyadic time windows form the index set in (3). (3)✦ The uniform partition of the closed unit interval into parts has boundaries for .✦ For , the batch midpoint times and the stages selected by are given in (4); the count is the number of times strictly earlier than .✦ (4) The consecutive system for is the consecutive batch window of that starts at stage and has batches. The window starting batch index is the number of batch midpoint times strictly before the left boundary of .✦ The window stopping batch index is the number of batch midpoint times strictly before the right boundary of .✦
Let be the logistic function. For real functions , , and a real scale , the smoothed graph rank is the function in (5). (5)✦ Suppose , and the are continuous, with the secant slope bounds in (6). (6) The smoothed rank coordinate is the member of given in (7). (7)✦ When slope-bounded rank coordinates and satisfy , their paired rank homeomorphism is given by (8). (8)✦ For a uniform exchange system on a generic configuration , with , and , the window convex graph family is the family in (9). (9)✦ The compact window label space is the countable cube in (10), with its product topology. (10)✦
In the paper, the result reads: for a sequence of generic systems of consecutive distance- batches on points with and , put and , give the batches the times in dyadic windows, and for full convex graphs with slopes inside the span of set , where is the distribution function of a continuous strictly positive probability density and is sufficiently small; for disjoint ordered windows , the map is a homeomorphism, and the labels lie in the countable cube .
What Is Checked
The window families are stated over generic finite configurations and uniform exchange systems with ; the paired chart is stated over arbitrary slope-bounded rank coordinates with . For continuous graphs, the smoothed rank is continuous at every real scale.✦ For its values belong to at every real scale.✦ For any nonempty finite family of real functions and any positive scale, the smoothed graph rank is strictly increasing with height on each vertical line.✦ For any nonempty finite family of real functions and any positive scale, the smoothed graph rank attains every level in on each vertical line.✦
For , every exchange edge has an edge token trace.✦
For separated slope bounds , each height difference has a zero.✦ With and , the rank level intersection abscissa is the chosen zero of ✦, and the inverse of the paired chart is given by (11). (11)