scientific article; zbMATH DE number 7378732
From MaRDI portal
Publication:5009629
DOI10.4230/LIPIcs.ESA.2018.62MaRDI QIDQ5009629
Michael Matheny, Jeff M. Phillips
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.11307
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- A deterministic view of random sampling and its use in geometry
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- Weighted random sampling with a reservoir
- Halfplanar range search in linear space and \(O(n^{0.695})\) query time
- Efficient partition trees
- Algorithms for ham-sandwich cuts
- Tight upper bounds for the discrepancy of half-spaces
- Geometric methods in the study of irregularities of distribution
- Constructive Discrepancy Minimization by Walking on the Edges
- Partitioning with two lines in the plane
- On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
- Polygon Retrieval
- A spatial scan statistic
- Constructing Planar Cuttings in Theory and Practice
- Deterministic sampling and range counting in geometric data streams
- Range counting over multidimensional data streams
- Optimal partition trees
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- Geometric discrepancy. An illustrated guide
- Improved bounds on the sample complexity of learning
This page was built for publication:
