Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 25 for “"Plane-sweep"”.

  1. Techniques for optimizing Fortune's plane-sweep algorithm for Voronoi diagrams

    … describes general optimization techniques for plane-sweep algorithms and an efficient and stable implementation of Fortune's algo­rithm, an O(N log N) plane-sweep algorithm for constructing the two-dimensional Voronoi diagram on N point sites. A module-level approach to implementing and …

    uvic Repository record for Techniques for optimizing Fortune's plane-sweep algorithm for Voronoi diagrams (opens in a new tab)

  2. Visualization of a plane sweep algorithm for construction of the visibility graph for robot path planning

    … algorithm for solving this problem is based on a plane-sweeping technique and runs in O(N{dollar}\sp2{dollar} log N) time; Since this solution has been studied very briefly in its theoretical form by (SS84), we present an in-depth analysis of the plane-sweep algorithm along with a full-scale …

    unlv Repository record for Visualization of a plane sweep algorithm for construction of the visibility graph for robot path planning (opens in a new tab) Download PDF for Visualization of a plane sweep algorithm for construction of the visibility graph for robot path planning (opens in a new tab)

  3. Acceleration of Computational Geometry Algorithms for High Performance Computing Based Geo-Spatial Big Data Analysis

    … following problems. Novel method to parallelize plane sweep based geometric intersection for GPU with directives is presented. Parallelization of plane sweep based Voronoi construction, parallelization of Segment tree construction, Segment tree queries and Segment tree-based operations has been …

    marquette Repository record for Acceleration of Computational Geometry Algorithms for High Performance Computing Based Geo-Spatial Big Data Analysis (opens in a new tab)

  4. Scalable clustering algorithms and optimization methods for parallel architectures

    … by coordinates on a two-dimensional Cartesian plane. These clustering methods are based on the well-known plane sweep algorithm that scans a coordinate plane with a goal to find intersections of the rectangles. The applications of these algorithms find their places in earth surface processing, …

    washington Repository record for Scalable clustering algorithms and optimization methods for parallel architectures (opens in a new tab)

  5. DeepMVS: learning multi-view stereopsis

    … posed images as input, we first produce a set of plane-sweep volumes and use the proposed DeepMVS network to predict high-quality disparity maps. The key contributions that enable these results are (1) supervised pretraining on a photorealistic synthetic dataset, (2) an effective method for …

    uiuc Repository record for DeepMVS: learning multi-view stereopsis (opens in a new tab)

  6. Accelerating Spatial Query Operations

    … active list portion of the traditional serial plane sweep algorithm. The first algorithm uses a single block of threads to simulate the active list data structure in hardware; this algorithm is slow due to GPU thread block size limitations and synchronization points, but demonstrates favorable …

    siu-theses Repository record for Accelerating Spatial Query Operations (opens in a new tab)

  7. Discovering Regularity in Point Clouds of Urban Scenes

    … regularity is discovered online by doing a plane sweep across the scene and analyzing the frequency space of each column in the sweep. The simplicity and online nature of this algorithm allow it to be embedded in scanner hardware, making periodicity detection a built-in feature of future 3D …

    cuny-grad Repository record for Discovering Regularity in Point Clouds of Urban Scenes (opens in a new tab)

  8. Δόμηση σημειακών δεδομένων και επεξεργασία χωρικών ερωτημάτων

    … enhancements on algorithms using classic plain sweep for join queries (kCPQ, εDJQ) with two input spatial data sets stored in main memory. One new algorithm (Reverse Run Plain Sweep - RRPS) was developed in order to improve the query processing of that type of queries executed on data stored in …

    greece Repository record for Δόμηση σημειακών δεδομένων και επεξεργασία χωρικών ερωτημάτων (opens in a new tab)

  9. Complete coverage path planning in an agricultural environment

    … sides. This multi-phase algorithm makes use of a plane-sweep algorithm to subdivide the field into smaller, trapezoidal regions. The optimal paths through the subregions are then calculated. Finally there is a merge phase where it is determined whether neighboring regions can be more efficiently …

    iastate Repository record for Complete coverage path planning in an agricultural environment (opens in a new tab)

  10. Sweep-Line Extensions to the Multiple Object Intersection Problem: Methods and Applications in Graph Mining

    … algorithmic paradigm, collectively known as the sweep-line or plane sweep algorithm. However, its application inherits a number of limitations including lack of versatility and lack of support for ad hoc intersection queries. With these limitations in mind, we design and implement a novel, exact, …

    york Repository record for Sweep-Line Extensions to the Multiple Object Intersection Problem: Methods and Applications in Graph Mining (opens in a new tab)

  11. JedAI-spatial: a system for 3-dimensional Geospatial Interlinking

    … περιλαμβάνει παραλλαγές του βασικού αλγορίθμου plane-sweep της υπολογιστικής γεωμετρίας. ii. Το Budget awareness διαχωρίζει τους αλγόριθμους διασύνδεσης σε budget-agnostic και budget-aware. Οι μέν απαρτίζονται από batch τεχνικές, που παράγουν αποτελέσματα μόνο μετά την επεξεργασία όλων των …

    athens Repository record for JedAI-spatial: a system for 3-dimensional Geospatial Interlinking (opens in a new tab)

  12. Topology building and random polygon generation

    … is a process of structuring data. We develop a plane sweep al gorithm for building a quad-edge data structure that captures the topological structure of connected components of a set of line segments. The algorithm starts with a data structure representing a single edge then adds edges into the …

    ubc Repository record for Topology building and random polygon generation (opens in a new tab) Download PDF for Topology building and random polygon generation (opens in a new tab)

  13. Multi-Dimensional Joins

    … join on low-dimensional data and is based on a plane-sweep technique. As we show analytically and experimentally, the Iterative Spatial Join performs well when internal memory is limited, compared to competing methods. This suggests that the Iterative Spatial Join would be useful for very large …

    maryland Repository record for Multi-Dimensional Joins (opens in a new tab)

  14. Underwater 3D Reconstruction Based on Physical Models for Refraction and Underwater Light Propagation

    … utilized in bundle adjustment, and a refractive plane sweep algorithm. Finally, if calibration data for an underwater light propagation model exists, the dense depth maps can be used to correct texture colors. Experiments with a perspective and the proposed refractive approach to 3D …

    cau-kiel Repository record for Underwater 3D Reconstruction Based on Physical Models for Refraction and Underwater Light Propagation (opens in a new tab)

  15. Underwater 3D Reconstruction Based on Physical Models for Refraction and Underwater Light Propagation

    … utilized in bundle adjustment, and a refractive plane sweep algorithm. Finally, if calibration data for an underwater light propagation model exists, the dense depth maps can be used to correct texture colors. Experiments with a perspective and the proposed refractive approach to 3D …

    cau-kiel Repository record for Underwater 3D Reconstruction Based on Physical Models for Refraction and Underwater Light Propagation (opens in a new tab)

  16. Computational aspects of spatial data analysis.

    … is the introduction of two methods based on the plane sweep algorithm to construct a distance based spatial weights matrix. The analysis of the new methods indicates that their computational parameters are superior to existing techniques. The implementation issues associated with the use of the …

    wvu Repository record for Computational aspects of spatial data analysis. (opens in a new tab)

  17. Learning Latent Image Representations with Prior Knowledge

    … learning-based method inspired by the classical plane sweep algorithm is studied. The method aims to improve the correspondence matching in two parts: obtaining better potential correspondence candidates with a novel plane sampling strategy and learning the multiplane representations instead of …

    aalto Repository record for Learning Latent Image Representations with Prior Knowledge (opens in a new tab)

  18. Representative Subsets for Preference Queries

    … mRTOP queries, using geometric duality and plane sweep. We show theoretically and empirically that the index is quick to build, small on disk, and very efficient at answering mRTOP queries. As a corollary to these efforts, we defined the top-k rank contour, which encodes the k-ranked tuple …

    uvic Repository record for Representative Subsets for Preference Queries (opens in a new tab)

  19. Multi-touch Detection and Semantic Response on Non-parametric Rear-projection Surfaces

    … architecture. One of the algorithms, a bounded plane sweep, is additionally able to estimate hover-surface distances, which we explore for interactions above surfaces. The proposed method is designed to operate with low latency and to be generalizable. We demonstrate touch-based interactions on …

    ucf Repository record for Multi-touch Detection and Semantic Response on Non-parametric Rear-projection Surfaces (opens in a new tab)

Page 1 of 2