Partitioning a polygonal region into trapezoids
نویسندگان
چکیده
منابع مشابه
Decomposing a Simple Polygon into Trapezoids
Chazelle’s triangulation [1] forms today the common basis for linear-time Euclidean shortest path (ESP) calculations (where start and end point are given within a simple polygon). This paper provides an alternative method for subdividing a simple polygon into “basic shapes”, using trapezoids instead of triangles. The authors consider the presented method as being substantially simpler than the ...
متن کاملSearching a Polygonal Region from the Boundary
Polygon search is the problem of nding unpredictable mobile intruders in a polygonal region using one or more mobile searchers with various levels of vision, where both the searcher and intruders are allowed to move freely within the region. In this paper we consider a variant of this problem, termed boundary search, in which a single searcher has to nd the intruders from the boundary of the re...
متن کاملCovering a Polygonal Region by Ellipses
We study the problem of how to cover a polygonal region by a small number of axis–parallel ellipses. This question is well motivated by a special pattern recognition task where one has to identify ellipse shaped protein spots in 2–dimensional electrophoresis images. We present and discuss two algorithmic approaches solving this problem: a greedy brute force method and a linear programming formu...
متن کاملCovering a polygonal region by rectangles
The problem of covering a compact canonical polygonal region, called target region, with a finite family of rectangles is considered. Tools for mathematical modeling of the problem are provided. Especially, a function, called Γ-function, is introduced which indicates whether the rectangles with respect to their configuration form a cover of the target region or not. The construction of the Γ-fu...
متن کاملPacking Two Disks into a Polygonal Environment
Prosenjit Bose1, Pat Morin2, and Antoine Vigneron3 1 Carleton University. [email protected] 2 McGill University. [email protected] 3 Hong Kong University of Science and Technology. [email protected] Abstract. We consider the following problem. Given a polygon P , possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1986
ISSN: 0004-5411,1557-735X
DOI: 10.1145/5383.5387