Partitioning arrangements of lines I: An efficient deterministic algorithm
نویسندگان
چکیده
منابع مشابه
Partitioning Arrangements of Lines I: An Efficient deterministic Algorithm
In this paper we consider the following problem: Given a set A ° of n lines in the plane, partition the plane into O(r 2) triangles so that no triangle meets more than O(n/r) lines of .~. We present a deterministic algorithm for this problem with O(nr log n log ° r) running time, where co is a constant < 3.33.
متن کاملAn Efficient MATLAB Algorithm for Graph Partitioning
This report describes a graph partitioning algorithm based on spectral factorization that can be implemented very efficiently with just a hand full of MATLAB commands. The algorithm is closely related to the one proposed by Phillips and Kokotović [3] for state-aggregation in Markov chains. The appendix contains a MATLAB script that implements the algorithm. 1 Graph partitioning Consider an undi...
متن کاملAn Efficient Extension of Network Simplex Algorithm
In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...
متن کاملAn Interconnectivity based Efficient Partitioning Algorithm of Combinational CMOS Circuits
In this new technology era, circuit partitioning is a fundamental problem in very large-scale integration (VLSI) physical design automation. In this brief, we present a new interconnection oriented clustering algorithm for combinational VLSI circuit partitioning. The proposed clustering method focuses on capturing clusters in a circuit, i. e. , the groups of cells that are highly interconnected...
متن کاملDesign and Implementation of an Efficient Thread Partitioning Algorithm
Recent advances in the development of a ne-grain multi-threaded program execution model based on o -the-shelf microprocessor technology has created an interesting challenge: how to partition a node program into threads that can exploit machine parallelism, achieve latency tolerance, and maintain reasonable locality of reference? A successful algorithm must produce a thread partition that best u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1990
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187805