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 16 of 16 for “"range searching"”.

  1. Partial Enclosure Range Searching

    This thesis examines a new type of range searching problem which we have called Partial Enclosure Range Searching. In this problem, given a set of geometric objects and a query region, our goal is to identify those objects where the size of their intersection with a query region is at least a fixed …

    carleton Repository record for Partial Enclosure Range Searching (opens in a new tab)

  2. Approximate Range Searching In The Absolute Error Model

    Range searching is a well known problem in computational geometry. We consider this problem in the context of approximation, where an approximation parameter eps > 0 is provided. Most prior work on this problem has focused on the relative error model, where each range shape R is bounded, and points …

    maryland Repository record for Approximate Range Searching In The Absolute Error Model (opens in a new tab)

  3. On Geometric Range Searching, Approximate Counting and Depth Problems

    In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching and orthogonal range searching and research into these problems has spanned …

    waterloo Repository record for On Geometric Range Searching, Approximate Counting and Depth Problems (opens in a new tab)

  4. From geometry to graphs and back: Geometric range searching and algorithms in structured graphs

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms

    uiuc Repository record for From geometry to graphs and back: Geometric range searching and algorithms in structured graphs (opens in a new tab)

  5. String Searching with Ranking Constraints and Uncertainty

    … role in many areas of computer science. Searching pattern in a string or string collection is one of the most classic problems. Different variations of this problem such as document retrieval, ranked document retrieval, dictionary matching has been well studied. Enormous growth of …

    lsu-thes Repository record for String Searching with Ranking Constraints and Uncertainty (opens in a new tab)

  6. Dynamic multiple pattern matching

    … the dictionary so as to provide efficient searching as well as efficient updates. We first present a solution to the one dimensional version of the problem where the patterns are strings. A salient feature of our solution is a DFA-based searching mechanism similar to the Knuth-Morris-Pratt …

    rice Repository record for Dynamic multiple pattern matching (opens in a new tab)

  7. Space Efficient Data Structures and Algorithms in the Word-RAM Model

    In modern computation the volume of data-sets has increased dramatically. Since the majority of these data-sets are stored in internal memory, reducing their storage requirement is an important research topic. One way of reducing storage is using succinct and compact data structures which maintain …

    waterloo Repository record for Space Efficient Data Structures and Algorithms in the Word-RAM Model (opens in a new tab)

  8. Autocorrelation techniques for soft photogrammetry

    … carried out on image processing, image matching searching strategies, feature type and image matching, and optimal window size in image matching. To make comparisons, the soft photogrammetry package SoftPlotter is used. Two aerial photographs from the Iowa State University campus high flight 94 …

    iastate Repository record for Autocorrelation techniques for soft photogrammetry (opens in a new tab)

  9. Adaptive Range Counting and Other Frequency-Based Range Query Problems

    We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that lie in the range. The most basic such computation involves counting the number of points in a query range. Data structures that compute this function …

    waterloo Repository record for Adaptive Range Counting and Other Frequency-Based Range Query Problems (opens in a new tab)

  10. Time Windowed Data Structures

    … number ofinfluenced vertices, using the colored range searching data structures.We also study data structures that can answer window queries for a sequence of geometric objects, such as points, line segments and convexc-gons. We study thewindowed intersection decision problemsfor these objects. …

    carleton Repository record for Time Windowed Data Structures (opens in a new tab)

  11. Efficient algorithms for the estimation of capacity and correlation dimension

    … of scale-invariant structure in strange attractors of nonlinear dynamical systems. Its first chapter is preliminary exposition, the object of which is the self-contained development, in an historical context, of the necessary background and nomenclature of nonlinear science and …

    ut-knoxville Repository record for Efficient algorithms for the estimation of capacity and correlation dimension (opens in a new tab)

  12. Geometric Algorithms for Objects in Motion

    … compressed data, we present a spatio-temporal range searching structure that operates without the need to decompress the data. In sum, the collection scheme, compression algorithm, theoretical analyses, and retrieval data structures provide a practical, yet theoretically sound, framework within …

    maryland Repository record for Geometric Algorithms for Objects in Motion (opens in a new tab)

  13. Algorithms for Unit-Disk Graphs and Related Problems

    … bottleneck moving spanning tree, unit-disk range reporting, distance selection, etc. We develop efficient algorithms for these problems and our results are either first-known solutions or somehow improve the previous work. Given a set P of n points in the plane and a parameter r > 0, a …

    utahstate Repository record for Algorithms for Unit-Disk Graphs and Related Problems (opens in a new tab)

  14. Algorithms and Data Structures for Geometric Intersection Query Problems

    … settings studied are primarily orthogonal range searching where the input is points and the query is an axes-aligned rectangle, and the dual setting of rectangle stabbing where the input is a set of axes-aligned rectangles and the query is a point. The aggregation functions studied are …

    umn Repository record for Algorithms and Data Structures for Geometric Intersection Query Problems (opens in a new tab)

  15. Representative Subsets for Preference Queries

    … general case, on geometric duality and halfspace range searching, and, in an important special case, on stereographic projection. In the second part of the dissertation, we investigate the monochromatic reverse top-k (mRTOP) query in two dimensions. A mRTOP query asks for, given a tuple and a …

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

  16. Δενδρικές δομές διαχείρισης πληροφορίας και βιομηχανικές εφαρμογές

    The dissertation examines problems of efficient organization of spatial data proposes specific tree structures for their management and finally gives examples of their use in specific application areas. The first chapter is about the problem of finding the iso oriented rectangles that enclose a …

    greece Repository record for Δενδρικές δομές διαχείρισης πληροφορίας και βιομηχανικές εφαρμογές (opens in a new tab)