How packed is it, really?

DOI10.57717/CGT.V4I1.65MaRDI QIDQ6913060zbMATH OpenFDO

Authors Sariel Har-Peled

Publication date 21 October 2025

Published in CGT. Computing in Geometry and Topology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.57717/CGT.V4I1.65

zbMATH Keywords

approximation algorithmscongestioncurvesFréchet distancepackedness

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20) Approximation algorithms (68W25)

Cites work

• Approximating the Fréchet distance for realistic curves in near linear time
• Approximating the Packedness of Polygonal Curves
• Edge Estimation with Independent Set Oracles
• Geometric approximation algorithms
• Geometric optimization and sums of algebraic functions
• Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)
• On Approximating the Depth and Related Problems
• The Computational Geometry of Comparing Shapes
• Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails

This page was built for publication: How packed is it, really?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6913060)