Computational Geometry with Probabilistically Noisy Primitive Operations
Fuente:
arXiv
Guardado en:
| Autores principales: | Eppstein, David, Goodrich, Michael T., Sridhar, Vinesh |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
por: Goodrich, Michael T., et al.
Publicado: (2025)
por: Goodrich, Michael T., et al.
Publicado: (2025)
Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
por: Eppstein, David, et al.
Publicado: (2025)
por: Eppstein, David, et al.
Publicado: (2025)
Fast Area-Weighted Peeling of Convex Hulls for Outlier Detection
por: Sridhar, Vinesh, et al.
Publicado: (2024)
por: Sridhar, Vinesh, et al.
Publicado: (2024)
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
por: Eppstein, David, et al.
Publicado: (2024)
por: Eppstein, David, et al.
Publicado: (2024)
Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)
por: Eppstein, David
Publicado: (2024)
Non-Euclidean Erdős-Anning Theorems
por: Eppstein, David
Publicado: (2024)
por: Eppstein, David
Publicado: (2024)
Visualizing Treewidth
por: Chiu, Alvin, et al.
Publicado: (2025)
por: Chiu, Alvin, et al.
Publicado: (2025)
Stabbing Faces By a Convex Curve
por: Eppstein, David
Publicado: (2025)
por: Eppstein, David
Publicado: (2025)
Orthogonal dissection into few rectangles
por: Eppstein, David
Publicado: (2022)
por: Eppstein, David
Publicado: (2022)
Decremental Greedy Polygons and Polyhedra Without Sharp Angles
por: Eppstein, David
Publicado: (2025)
por: Eppstein, David
Publicado: (2025)
Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
por: Eppstein, David
Publicado: (2023)
por: Eppstein, David
Publicado: (2023)
Maintaining Light Spanners via Minimal Updates
por: Khodabandeh, Hadi, et al.
Publicado: (2024)
por: Khodabandeh, Hadi, et al.
Publicado: (2024)
On the complexity of embedding in graph products
por: Biedl, Therese, et al.
Publicado: (2023)
por: Biedl, Therese, et al.
Publicado: (2023)
Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
por: Goodrich, Michael T., et al.
Publicado: (2024)
por: Goodrich, Michael T., et al.
Publicado: (2024)
How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
por: Gila, Ofek, et al.
Publicado: (2026)
por: Gila, Ofek, et al.
Publicado: (2026)
Computing Diffusion Geometry
por: Jones, Iolo, et al.
Publicado: (2026)
por: Jones, Iolo, et al.
Publicado: (2026)
Making Quickhull More Like Quicksort: A Simple Randomized Output-Sensitive Convex Hull Algorithm
por: Goodrich, Michael T., et al.
Publicado: (2024)
por: Goodrich, Michael T., et al.
Publicado: (2024)
Better Late than Never: the Complexity of Arrangements of Polyhedra
por: Aronov, Boris, et al.
Publicado: (2025)
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)
por: Fukuzawa, Shion, et al.
Publicado: (2025)
Algorithms for Dynamic Computational Geometry with Applications
por: Boxer, Laurence
Publicado: (2025)
por: Boxer, Laurence
Publicado: (2025)
Bicriteria Polygon Aggregation with Arbitrary Shapes
por: Blank, Lotte, et al.
Publicado: (2025)
por: Blank, Lotte, et al.
Publicado: (2025)
Software for the Thompson and Funk Polygonal Geometry
por: Banerjee, Hridhaan, et al.
Publicado: (2025)
por: Banerjee, Hridhaan, et al.
Publicado: (2025)
Fast Geographic Routing in Fixed-Growth Graphs
por: Gila, Ofek, et al.
Publicado: (2025)
por: Gila, Ofek, et al.
Publicado: (2025)
Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
por: Eppstein, David, et al.
Publicado: (2025)
por: Eppstein, David, et al.
Publicado: (2025)
Noncrossing Longest Paths and Cycles
por: Aloupis, Greg, et al.
Publicado: (2024)
por: Aloupis, Greg, et al.
Publicado: (2024)
The Complexity of Iterated Reversible Computation
por: Eppstein, David
Publicado: (2021)
por: Eppstein, David
Publicado: (2021)
Revisiting Accurate Geometry for Morse-Smale Complexes
por: Thanh, Son Le, et al.
Publicado: (2024)
por: Thanh, Son Le, et al.
Publicado: (2024)
On Voronoi diagrams in the Funk Conical Geometry
por: Acharya, Aditya, et al.
Publicado: (2026)
por: Acharya, Aditya, et al.
Publicado: (2026)
Ipelets for the Convex Polygonal Geometry
por: Parepally, Nithin, et al.
Publicado: (2024)
por: Parepally, Nithin, et al.
Publicado: (2024)
On the Duality of Coverings in Hilbert Geometry
por: Arya, Sunil, et al.
Publicado: (2026)
por: Arya, Sunil, et al.
Publicado: (2026)
Probabilistic Analysis of Multiparameter Persistence Decompositions
por: Alonso, Ángel Javier, et al.
Publicado: (2024)
por: Alonso, Ángel Javier, et al.
Publicado: (2024)
On Saxe's theorems about the complexity of the Distance Geometry Problem
por: Kupperschmitt, Maël, et al.
Publicado: (2025)
por: Kupperschmitt, Maël, et al.
Publicado: (2025)
Geometry and design of popup structures
por: Chavda, Jay Jayeshbhai, et al.
Publicado: (2026)
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)
por: Congedo, Marco, et al.
Publicado: (2013)
Visualizing Higher Order Structures, Overlap Regions, and Clustering in the Hilbert Geometry
por: Banerjee, Hridhaan, et al.
Publicado: (2026)
por: Banerjee, Hridhaan, et al.
Publicado: (2026)
Search-Based Robot Motion Planning With Distance-Based Adaptive Motion Primitives
por: Kraljusic, Benjamin, et al.
Publicado: (2025)
por: Kraljusic, Benjamin, et al.
Publicado: (2025)
Computing the Bottleneck Distance between Persistent Homology Transforms
por: Kerber, Michael, et al.
Publicado: (2025)
por: Kerber, Michael, et al.
Publicado: (2025)
Computation of symmetries of rational surfaces
por: Alcázar, Juan Juan Gerardo, et al.
Publicado: (2024)
por: Alcázar, Juan Juan Gerardo, et al.
Publicado: (2024)
Flexible and Probabilistic Topology Tracking with Partial Optimal Transport
por: Li, Mingzhe, et al.
Publicado: (2023)
por: Li, Mingzhe, et al.
Publicado: (2023)
Symplectic Flatness and Twisted Primitive Cohomology
por: Tseng, Li-Sheng, et al.
Publicado: (2022)
por: Tseng, Li-Sheng, et al.
Publicado: (2022)
Ejemplares similares
-
Optimal Parallel Algorithms for Convex Hulls in 2D and 3D under Noisy Primitive Operations
por: Goodrich, Michael T., et al.
Publicado: (2025) -
Entropy-Bounded Computational Geometry Made Easier and Sensitive to Sortedness
por: Eppstein, David, et al.
Publicado: (2025) -
Fast Area-Weighted Peeling of Convex Hulls for Outlier Detection
por: Sridhar, Vinesh, et al.
Publicado: (2024) -
Drawing Planar Graphs and 1-Planar Graphs Using Cubic Bézier Curves with Bounded Curvature
por: Eppstein, David, et al.
Publicado: (2024) -
Computational Complexities of Folding
por: Eppstein, David
Publicado: (2024)