Planar Separators and Parallel Polygon Triangulation
نویسندگان
چکیده
منابع مشابه
Planar Separators and Parallel Polygon Triangulation
We show how to construct an O p n separator decomposition of a planar graph G in O n time Such a decomposition de nes a binary tree where each node corresponds to a subgraph of G and stores an O p n separator of that subgraph We also show how to construct an O n way decomposition tree in parallel in O log n time so that each node corresponds to a subgraph of G and stores an O n separator of tha...
متن کاملExperiments on Parallel Polygon Triangulation Using Ear Clipping
We present an experimental study of different strategies for triangulating polygons in parallel. As usual, we call three consecutive vertices of a polygon an ear if the triangle that is spanned by them is completely inside of the polygon. Extensive tests on thousands of sample polygons indicate that most polygons have a linear number of ears. This experimental result suggests that polygon-trian...
متن کاملA Simple Polygon Triangulation Algorithm
In this Paper we propose an easily implementable polygon triangulation algorithm using Shortest Paths. The algorithm runs in O(nlogk) deterministic time with k < n 3 . Our algorithm runs in linear time for a large class of polygons. The biggest advantage of the algorithm is that it uses very simple data structures and it computes the triangulation just by scanning the boundary of the polygon. W...
متن کاملI/O-Efficient Planar Separators
We present I/O-efficient algorithms for computing optimal separator partitions of planar graphs. Our main result shows that, given a planar graph G with N vertices and an integer r > 0, a vertex separator of size O(N/ √ r) that partitions G into O(N/r) subgraphs of size at most r and boundary size O( √ r) can be computed in O(sort(N)) I/Os. This bound holds provided that M ≥ 56r log B. Together...
متن کاملHomology of Planar Polygon
In this paper we study topology of the variety of closed pla-nar n-gons with given side lengths l1,. .. , ln. The moduli space M ℓ where ℓ = (l1,. .. , ln), encodes the shapes of all such n-gons. We describe the Betti numbers of the moduli spaces M ℓ as functions of the length vector ℓ = (l1,. .. , ln). We also find sharp upper bounds on the sum of Betti numbers of M ℓ depending only on the num...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1995
ISSN: 0022-0000
DOI: 10.1006/jcss.1995.1076