Polygon Retrieval
From MaRDI portal
Cited in
(53)- Conical equipartitions of mass distributions
- Storing line segments in partition trees
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- On range searching with semialgebraic sets
- Efficient searching with linear constraints
- Tight lower bounds for halfspace range searching
- Algorithms for ham-sandwich cuts
- On counting pairs of intersecting segments and off-line triangle range searching
- How hard is half-space range searching?
- On a problem about quadrant-depth
- Diameter partitioning
- -nets and simplex range queries
- Efficient partition trees
- The power of geometric duality
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Linear space data structures for two types of range search
- Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
- Reporting points in halfspaces
- Implicitly representing arrangements of lines or segments
- On range searching with semialgebraic sets
- New trie data structures which support very fast search operations
- Topology of the Grünbaum–Hadwiger–Ramos hyperplane mass partition problem
- New applications of random sampling in computational geometry
- Lower bounds for semialgebraic range searching and stabbing problems
- Fitting a step function to a point set with outliers based on simplicial thickness data structures
- Efficient randomized algorithms for robust estimation of circular arcs and aligned ellipses
- Improved points approximation algorithms based on simplicial thickness data structures
- Lower bounds for semialgebraic range searching and stabbing problems
- Quasi-optimal range searching in spaces of finite VC-dimension
- scientific article; zbMATH DE number 7378732 (Why is no real title available?)
- Simplex range reporting on a pointer machine
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Dynamic enumeration of similarity joins
- Points with large \(\alpha \)-depth
- Topology and combinatorics of partitions of masses by hyperplanes
- Computing a ham-sandwich cut in two dimensions
- On the number of line separations of a finite set in the plane
- A survey of mass partitions
- Dynamic partition trees
- Partitioning point sets in arbitrary dimension
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems
- Approximate range searching
- Optimal partition trees
- Simplex Range Searching and Its Variants: A Review
- Lower Bounds on the Complexity of Polytope Range Searching
- An equipartition of planar sets
- Non-partitionable point sets
- Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem
- Equipartition of mass distributions by hyperplanes
- Half-plane point retrieval queries with independent and dependent geometric uncertainties
- Dynamic partition trees
- Separating collections of points in Euclidean spaces
- The power of geometric duality revisited
This page was built for publication: Polygon Retrieval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3936209)
