Robust Plane Sweep for Intersecting Segments
نویسندگان
چکیده
منابع مشابه
Robust Plane Sweep for Intersecting Segments
In this paper, we reexamine in the framework of robust computation the BentleyOttmann algorithm for reporting intersecting pairs of segments in the plane. This algorithm has been reported as being very sensitive to numerical errors. Indeed, a simple analysis reveals that it involves predicates of degree 5, presumably never evaluated exactly in most implementation. Within the exact-computation p...
متن کاملRefractive Plane Sweep for Underwater Images
In underwater imaging, refraction changes the geometry of image formation, causing the perspective camera model to be invalid. Hence, a systematic model error occurs when computing 3D models using the perspective camera model. This paper deals with the problem of computing dense depth maps of underwater scenes with explicit incorporation of refraction of light at the underwater housing. It is a...
متن کاملSpace-Efficient Plane-Sweep Algorithms
We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of n items and that the available workspace is Θ(s) bits, where lgn ≤ s ≤ n · lg n. In particular, we give an almost-optimal algorithm for finding the closest pair among a set of n points that runs in O(n/s+n·lg s) time. We give a simple algorithm to enum...
متن کاملReal-time Plane-sweep with Local Strategy
Recent research in computer vision has made significant progress in the reconstruction of depth information from two-dimensional images. A new challenge is to extend these techniques to video images. Given a small set of calibrated video cameras, our goal is to render on-line dynamic scenes in real-time from new viewpoints. This paper presents an image-based rendering system using photogrametri...
متن کاملSweep-plane Approach to Bounding Box Intersection
This paper summarises an effort towards approximation of an optimal sweepplane approach to axis aligned bounding box intersection problem. In particular a spatial hash table and priority search tree are combined in order to obtain a data structure suitable for solving two-dimensional dynamic rectangle intersection problem. Some variants of this structure allow logarithmic update and query times...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2000
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539797329373