Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons
نویسندگان
چکیده
A hierarchical decomposition of a simple polygon is introduced. The hierarchy has depth O(log n), linear size, and its regions have at most three neighbors. Using this hierarchy, circular ray shooting queries in a simple polygon can be answered in O(log n) query time and O(n log n) space. If the radius of the circle is xed, the query time can be improved to O(log n) and the space to O(n).
منابع مشابه
Cost prediction for ray shooting in octrees
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not very practical, while practical methods offer few provable guarantees on performance. Attempting to combine practicality with theoretical soundness, we show how to provably measure the average performance of any ray-shoot...
متن کاملParabola Separation Queries and their Application to Stone Throwing
Given two sets A and B of m non-intersecting line segments in the plane, we show how to compute in O(m logm) time a data structure that uses O(m) space and allows to answer the following query in O(logm) time: Given a parabola γ : y = ax+bx+c, does γ separate A and B? This structure can be used to build a data structure that stores a simple polygon and allows ray-shooting queries along paraboli...
متن کاملOn Compatible Star Decompositions of Simple Polygons
We introduce the notion of compatible star decompositions of simple polygons. In general, given two polygons with a correspondence between their vertices, two polygonal decompositions of the two polygons are said to be compatible if there exists a one-to-one mapping between them such that the corresponding pieces are defined by corresponding vertices. For compatible star decompositions, we also...
متن کاملOptimal Mesh Algorithms for Proximity and Visibility Problems in Simple Polygons*
We present optimal parallel algorithms that run in O p n time on a p n pn mesh connected computer for a number of fundamental problems concerning proximity and vis ibility in a simple polygon These include computing shortest paths shortest path trees shortest path partitions all farthest neighbors the visibility polygon of a point the weak visibility polygon of an edge and the ray shooting problem
متن کاملPolygonal Minkowski Sums via Convolution : Theory and Practice
This thesis studies theoretical and practical aspects of the computation of planar polygonal Minkowski sums via convolution methods. In particular we prove the “Convolution Theorem”, which is fundamental to convolution based methods, for the case of simple polygons. To the best of our knowledge this is the first complete proof for this case. Moreover, we describe a complete, exact and efficient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 32 شماره
صفحات -
تاریخ انتشار 2004