Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
نویسندگان
چکیده
منابع مشابه
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
A greedily routable region (GRR) is a closed subset of R, in which any destination point can be reached from any starting point by always moving in the direction with maximum reduction of the distance to the destination in each point of the path. Recently, Tan and Kermarrec proposed a geographic routing protocol for dense wireless sensor networks based on decomposing the network area into a sma...
متن کاملA Graph-Theoretical Approach for Partitioning RNA Secondary Structures into Pseudonotted and Pseudoknot-free Regions
Dual graphs have been applied to model RNA secondary structures with pseudoknots, or intertwined base pairs. In this paper we present a linear-time algorithm to partition dual graphs into topological components called blocks and determine whether each block contains a pseudoknot or not. We show that a block contains a pseudoknot if and only if the block has a vertex of degree 3 or more; this ch...
متن کاملPartitioning Regular Polygons into Circular Pieces II:Nonconvex Partitions
In [DO03] we explored partitioning regular k-gons into “circular” convex pieces. Circularity of a polygon is measured by the aspect ratio: the ratio of the diameters of the smallest circumscribing circle to the largest inscribed disk. We seek partitions with aspect ratio close to 1, ideally the optimal ratio. Although we start with regular polygons, most of the machinery developed extends to ar...
متن کاملPartitioning orthogonal polygons into fat rectangles in polynomial time
We provide a polynomial-time algorithm to partition an orthogonal polygon of n vertices into isothetic rectangles so that the shortest rectangle side is maximized over all rectangles. Thus no rectangle is “thin”; all rectangles are “fat.”
متن کاملGreedily Partitioning the Natural Numbers into Sets Free of Arithmetic Progressions
We describe a "greedy" algorithm for partitioning the natural numbers into sets free of arithmetic progressions of length 3. A recursive formula governing the resulting partition is proved, and some features of its asymptotic behavior are discussed. Introduction. In 1927, van der Waerden [12] showed that if the set of nonnegative integers is partitioned into a finite number of sets, one of thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2017
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195917600068