Image de couverture de livre

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eppstein, David, Goodrich, Michael T., Illickan, Abraham M., To, Claire A.
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
par: Eppstein, David, et autres
Publié: (2024)

Computational Geometry with Probabilistically Noisy Primitive Operations
par: Eppstein, David, et autres
Publié: (2025)

Computational Complexities of Folding
par: Eppstein, David
Publié: (2024)

Non-Euclidean Erdős-Anning Theorems
par: Eppstein, David
Publié: (2024)

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

Stabbing Faces By a Convex Curve
par: Eppstein, David
Publié: (2025)

Orthogonal dissection into few rectangles
par: Eppstein, David
Publié: (2022)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
par: Eppstein, David
Publié: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
par: Goodrich, Michael T., et autres
Publié: (2024)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

On the complexity of embedding in graph products
par: Biedl, Therese, et autres
Publié: (2023)

Optimal Volume-Sensitive Bounds for Polytope Approximation
par: Arya, Sunil, et autres
Publié: (2023)

Computing Diffusion Geometry
par: Jones, Iolo, et autres
Publié: (2026)

Optimal Area-Sensitive Bounds for Polytope Approximation
par: Arya, Sunil, et autres
Publié: (2023)

Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
par: Goodrich, Michael T., et autres
Publié: (2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra
par: Aronov, Boris, et autres
Publié: (2025)

Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
par: Fukuzawa, Shion, et autres
Publié: (2025)

Fast Geographic Routing in Fixed-Growth Graphs
par: Gila, Ofek, et autres
Publié: (2025)

Algorithms for Dynamic Computational Geometry with Applications
par: Boxer, Laurence
Publié: (2025)

Software for the Thompson and Funk Polygonal Geometry
par: Banerjee, Hridhaan, et autres
Publié: (2025)

Bicriteria Polygon Aggregation with Arbitrary Shapes
par: Blank, Lotte, et autres
Publié: (2025)

On the Duality of Coverings in Hilbert Geometry
par: Arya, Sunil, et autres
Publié: (2026)

On Voronoi diagrams in the Funk Conical Geometry
par: Acharya, Aditya, et autres
Publié: (2026)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)

Noncrossing Longest Paths and Cycles
par: Aloupis, Greg, et autres
Publié: (2024)

The Complexity of Iterated Reversible Computation
par: Eppstein, David
Publié: (2021)

Revisiting Accurate Geometry for Morse-Smale Complexes
par: Thanh, Son Le, et autres
Publié: (2024)

Ipelets for the Convex Polygonal Geometry
par: Parepally, Nithin, et autres
Publié: (2024)

AniDoc: Animation Creation Made Easier
par: Meng, Yihao, et autres
Publié: (2024)

On Saxe's theorems about the complexity of the Distance Geometry Problem
par: Kupperschmitt, Maël, et autres
Publié: (2025)

Visualizing Higher Order Structures, Overlap Regions, and Clustering in the Hilbert Geometry
par: Banerjee, Hridhaan, et autres
Publié: (2026)

In the School Library: Finding Information Made Easier
par: Taylor, Audrey, et autres
Publié: (1976)

Geometry and design of popup structures
par: Chavda, Jay Jayeshbhai, et autres
Publié: (2026)

A New Generation of Brain-Computer Interface Based on Riemannian Geometry
par: Congedo, Marco, et autres
Publié: (2013)

Bounding and computing obstacle numbers of graphs
par: Balko, Martin, et autres
Publié: (2022)

An Improved Bound for Plane Covering Paths
par: Akitaya, Hugo A., et autres
Publié: (2025)

Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
par: Lyu, Weiran, et autres
Publié: (2024)

Input-Sensitive Reconfiguration of Sliding Cubes
par: Akitaya, Hugo, et autres
Publié: (2025)

Computing the Bottleneck Distance between Persistent Homology Transforms
par: Kerber, Michael, et autres
Publié: (2025)