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