research
∙
08/17/2023
Smooth Distance Approximation
Traditional problems in computational geometry involve aspects that are ...
share
research
∙
06/27/2023
Optimal Area-Sensitive Bounds for Polytope Approximation
Approximating convex bodies is a fundamental question in geometry and ha...
research
∙
06/27/2023
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
We present a new approach to approximate nearest-neighbor queries in fix...
research
∙
04/05/2023
Analysis of Dynamic Voronoi Diagrams in the Hilbert Metric
The Hilbert metric is a projective metric defined on a convex body which...
research
∙
03/16/2023
Optimal Volume-Sensitive Bounds for Polytope Approximation
Approximating convex bodies is a fundamental question in geometry and ha...
research
∙
03/15/2023
Economical Convex Coverings and Applications
Coverings of convex bodies have emerged as a central component in the de...
research
∙
08/11/2022
Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching
Motivated by blockchain technology for supply-chain tracing of ethically...
research
∙
03/30/2022
Optimally Tracking Labels on an Evolving Tree
Motivated by the problem of maintaining data structures for a large sets...
research
∙
12/08/2021
A PTAS for the Min-Max Euclidean Multiple TSP
We present a polynomial-time approximation scheme (PTAS) for the min-max...
research
∙
12/06/2021
Voronoi Diagrams in the Hilbert Metric
The Hilbert metric is a distance function defined for points lying withi...
research
∙
03/30/2021
Approximate Nearest-Neighbor Search for Line Segments
Approximate nearest-neighbor search is a fundamental algorithmic problem...
research
∙
02/16/2020
Coresets for the Nearest-Neighbor Rule
The problem of nearest-neighbor condensation deals with finding a subset...
research
∙
10/30/2019
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Convex bodies play a fundamental role in geometric computation, and appr...
research
∙
07/02/2018