Imagen de Portada

Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Eppstein, David, Goodrich, Michael T., Illickan, Abraham M., To, Claire A.
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
por: Eppstein, David, et al.
Publicado: (2024)

Computational Geometry with Probabilistically Noisy Primitive Operations
por: Eppstein, David, et al.
Publicado: (2025)

Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)

Non-Euclidean Erdős-Anning Theorems
por: Eppstein, David
Publicado: (2024)

Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)

Stabbing Faces By a Convex Curve
por: Eppstein, David
Publicado: (2025)

Orthogonal dissection into few rectangles
por: Eppstein, David
Publicado: (2022)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
por: Eppstein, David
Publicado: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
por: Eppstein, David
Publicado: (2023)

Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
por: Goodrich, Michael T., et al.
Publicado: (2024)

Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)

On the complexity of embedding in graph products
por: Biedl, Therese, et al.
Publicado: (2023)

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

Computing Diffusion Geometry
por: Jones, Iolo, et al.
Publicado: (2026)

Optimal Area-Sensitive Bounds for Polytope Approximation
por: Arya, Sunil, et al.
Publicado: (2023)

Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
por: Goodrich, Michael T., et al.
Publicado: (2025)

Better Late than Never: the Complexity of Arrangements of Polyhedra
por: Aronov, Boris, et al.
Publicado: (2025)

Quantum Combine and Conquer and Its Applications to Sublinear Quantum Convex Hull and Maxima Set Construction
por: Fukuzawa, Shion, et al.
Publicado: (2025)

Fast Geographic Routing in Fixed-Growth Graphs
por: Gila, Ofek, et al.
Publicado: (2025)

Algorithms for Dynamic Computational Geometry with Applications
por: Boxer, Laurence
Publicado: (2025)

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

Bicriteria Polygon Aggregation with Arbitrary Shapes
por: Blank, Lotte, et al.
Publicado: (2025)

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

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

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
por: Eppstein, David, et al.
Publicado: (2025)

Noncrossing Longest Paths and Cycles
por: Aloupis, Greg, et al.
Publicado: (2024)

The Complexity of Iterated Reversible Computation
por: Eppstein, David
Publicado: (2021)

Revisiting Accurate Geometry for Morse-Smale Complexes
por: Thanh, Son Le, et al.
Publicado: (2024)

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

AniDoc: Animation Creation Made Easier
por: Meng, Yihao, et al.
Publicado: (2024)

On Saxe's theorems about the complexity of the Distance Geometry Problem
por: Kupperschmitt, Maël, et al.
Publicado: (2025)

Visualizing Higher Order Structures, Overlap Regions, and Clustering in the Hilbert Geometry
por: Banerjee, Hridhaan, et al.
Publicado: (2026)

In the School Library: Finding Information Made Easier
por: Taylor, Audrey, et al.
Publicado: (1976)

Geometry and design of popup structures
por: Chavda, Jay Jayeshbhai, et al.
Publicado: (2026)

A New Generation of Brain-Computer Interface Based on Riemannian Geometry
por: Congedo, Marco, et al.
Publicado: (2013)

Bounding and computing obstacle numbers of graphs
por: Balko, Martin, et al.
Publicado: (2022)

An Improved Bound for Plane Covering Paths
por: Akitaya, Hugo A., et al.
Publicado: (2025)

Fast Comparative Analysis of Merge Trees Using Locality Sensitive Hashing
por: Lyu, Weiran, et al.
Publicado: (2024)

Computing the Bottleneck Distance between Persistent Homology Transforms
por: Kerber, Michael, et al.
Publicado: (2025)

Input-Sensitive Reconfiguration of Sliding Cubes
por: Akitaya, Hugo, et al.
Publicado: (2025)