:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Arya, Sunil, da Fonseca, Guilherme D., Mount, David M.
Format:	Preprint
Published:	2023
Subjects:	Computational Geometry
Online Access:	https://arxiv.org/abs/2306.15648
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Volume-Sensitive Bounds for Polytope Approximation
by: Arya, Sunil, et al.
Published: (2023)

Cauchy's Surface Area Formula in the Funk Geometry
by: Arya, Sunil, et al.
Published: (2026)

On the Duality of Coverings in Hilbert Geometry
by: Arya, Sunil, et al.
Published: (2026)

Convex Covering Using Collections of Convex Polygons and Set Cover
by: da Fonseca, Guilherme D.
Published: (2023)

Approximation Depth of Convex Polytopes
by: Bakaev, Egor, et al.
Published: (2025)

Shadoks Approach to Knapsack Polygonal Packing
by: da Fonseca, Guilherme D., et al.
Published: (2024)

Evolving Distributions Under Local Motion
by: Acharya, Aditya, et al.
Published: (2024)

Untangling Segments in the Plane
by: da Fonseca, Guilherme D., et al.
Published: (2025)

Shadoks Approach to Parallel Reconfiguration of Triangulations
by: da Fonseca, Guilherme D., et al.
Published: (2026)

Further Connectivity Results on Plane Spanning Path Reconfiguration
by: Boucard, Valentino, et al.
Published: (2024)

Classifiers in High Dimensional Hilbert Metrics
by: Acharya, Aditya, et al.
Published: (2026)

On Voronoi diagrams in the Funk Conical Geometry
by: Acharya, Aditya, et al.
Published: (2026)

Kan Approximations of the Persistent Homology Transform
by: Arya, Shreya, et al.
Published: (2025)

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
by: Eppstein, David, et al.
Published: (2025)

Carving Polytopes with Saws in 3D
by: Robson, Eliot W., et al.
Published: (2024)

On Finding the Closest Zonotope to a Polytope in Hausdorff Distance
by: Torres, George D.
Published: (2024)

Local Routing on a Convex Polytope in R^3
by: Chandran, Sreehari, et al.
Published: (2025)

On The Heine-Borel Property and Minimum Enclosing Balls
by: Banerjee, Hridhaan, et al.
Published: (2024)

Software for the Thompson and Funk Polygonal Geometry
by: Banerjee, Hridhaan, et al.
Published: (2025)

Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)

Analysis of Dynamic Voronoi Diagrams in the Hilbert Metric
by: Bumpus, Madeline, et al.
Published: (2023)

Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution
by: Gokaj, Geri, et al.
Published: (2026)

Ipelets for the Convex Polygonal Geometry
by: Parepally, Nithin, et al.
Published: (2024)

Near-Optimal Bounds for Parameterized Euclidean k-means
by: Cohen-Addad, Vincent, et al.
Published: (2026)

Advancing Geometry with AI: Multi-agent Generation of Polytopes
by: Swirszcz, Grzegorz, et al.
Published: (2025)

French Onion Soup, Ipelets for Points and Polygons
by: Faber, Klint, et al.
Published: (2025)

Proximity Alert: Ipelets for Neighborhood Graphs and Clustering
by: Balogh, Gitan, et al.
Published: (2026)

Compression Maps Between Polytopes
by: Ayala, José, et al.
Published: (2025)

Faster Algorithms for Growing Collision-Free Convex Polytopes in Robot Configuration Space
by: Werner, Peter, et al.
Published: (2024)

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)

A Bound on the Symplectic Systolic Ratio of Polytopes in Even-Dimensional Euclidean Space
by: Zediker, Matthew
Published: (2025)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
by: Cohen-Addad, Vincent, et al.
Published: (2026)

The Optimal Ratio of a Generalized Chaos Game in Regular Polytopes
by: Tarmet, Christoffer
Published: (2025)

Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs
by: Chambers, Erin Wolf, et al.
Published: (2025)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
by: de Berg, Sarita, et al.
Published: (2026)

Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
by: La, An, et al.
Published: (2025)

Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
by: Bringmann, Karl, et al.
Published: (2024)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
by: Picarella, Gianmarco, et al.
Published: (2025)

Approximating Gromov-Hausdorff Distance in Euclidean Space
by: Majhi, Sushovan, et al.
Published: (2019)

A Lower Bound of the Hofer-Zehnder Capacity via Delzant Polytopes
by: Liu, Yichen
Published: (2023)