On geodesic disks enclosing many points
Fuente:
arXiv
Saved in:
| Main Authors: | Bose, Prosenjit, Esteban, Guillermo, Orden, David, Silveira, Rodrigo, Tuttle, Tyler |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Approximating shortest paths in weighted square and hexagonal meshes
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
On approximating shortest paths in weighted triangular tessellations
by: Bose, Prosenjit, et al.
Published: (2021)
by: Bose, Prosenjit, et al.
Published: (2021)
Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)
by: de Berg, Mark, et al.
Published: (2026)
Approximating the Smallest $k$-Enclosing Geodesic Disc in a Simple Polygon
by: Bose, Prosenjit, et al.
Published: (2024)
by: Bose, Prosenjit, et al.
Published: (2024)
Tight Routing and Spanning Ratios of Arbitrary Triangle Delaunay Graphs
by: Bose, Prosenjit, et al.
Published: (2025)
by: Bose, Prosenjit, et al.
Published: (2025)
The Exact Spanning Ratio of the Parallelogram Delaunay Graph
by: Bose, Prosenjit, et al.
Published: (2023)
by: Bose, Prosenjit, et al.
Published: (2023)
Minimal enclosing balls via geodesics
by: Goodwin, Ariel, et al.
Published: (2026)
by: Goodwin, Ariel, et al.
Published: (2026)
Exact solutions to the Weighted Region Problem
by: de Berg, Sarita, et al.
Published: (2024)
by: de Berg, Sarita, et al.
Published: (2024)
On the complexity of covering points by guillotine cuts
by: Garijo, Delia, et al.
Published: (2026)
by: Garijo, Delia, et al.
Published: (2026)
On polynomials associated to Voronoi diagrams of point sets and crossing numbers
by: Claverol, Mercè, et al.
Published: (2023)
by: Claverol, Mercè, et al.
Published: (2023)
A simple linear time algorithm for smallest enclosing circles on the (hemi)sphere
by: Flemming, Jens
Published: (2024)
by: Flemming, Jens
Published: (2024)
Rainbow polygons for colored point sets in the plane
by: Flores-Peñaloza, David, et al.
Published: (2020)
by: Flores-Peñaloza, David, et al.
Published: (2020)
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4
by: Löffler, Maarten, et al.
Published: (2024)
by: Löffler, Maarten, et al.
Published: (2024)
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
by: Alegría-Galicia, Carlos, et al.
Published: (2017)
by: Alegría-Galicia, Carlos, et al.
Published: (2017)
Noncrossing Longest Paths and Cycles
by: Aloupis, Greg, et al.
Published: (2024)
by: Aloupis, Greg, et al.
Published: (2024)
Optimizing generalized kernels of polygons
by: Martinez-Moraian, Alejandra, et al.
Published: (2018)
by: Martinez-Moraian, Alejandra, et al.
Published: (2018)
Computing largest minimum color-spanning intervals of imprecise points
by: Acharyya, Ankush, et al.
Published: (2024)
by: Acharyya, Ankush, et al.
Published: (2024)
The Spanning Ratio of the Directed $Θ_6$-Graph is 5
by: Bose, Prosenjit, et al.
Published: (2026)
by: Bose, Prosenjit, et al.
Published: (2026)
Geometric and statistical techniques for projective mapping of chocolate chip cookies with a large number of consumers
by: Orden, David, et al.
Published: (2020)
by: Orden, David, et al.
Published: (2020)
Towards the mathematical foundation of the minimum enclosing ball and related problems
by: Vrahatis, Michael N.
Published: (2024)
by: Vrahatis, Michael N.
Published: (2024)
Towards the methodology for solving the minimum enclosing ball and related problems
by: Vrahatis, Michael N.
Published: (2024)
by: Vrahatis, Michael N.
Published: (2024)
An Improved Bound for Plane Covering Paths
by: Akitaya, Hugo A., et al.
Published: (2025)
by: Akitaya, Hugo A., et al.
Published: (2025)
Generic density of stationary geodesic nets that are not closed geodesics
by: Talipov, Talant
Published: (2025)
by: Talipov, Talant
Published: (2025)
Tight Bounds on the Number of Closest Pairs in Vertical Slabs
by: Biniaz, Ahmad, et al.
Published: (2025)
by: Biniaz, Ahmad, et al.
Published: (2025)
An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
by: Flores-Peñaloza, David, et al.
Published: (2024)
by: Flores-Peñaloza, David, et al.
Published: (2024)
Counting geodesics between surface triangulations
by: Parlier, Hugo, et al.
Published: (2023)
by: Parlier, Hugo, et al.
Published: (2023)
Maximum rectilinear convex subsets
by: González-Aguilar, Hernán, et al.
Published: (2019)
by: González-Aguilar, Hernán, et al.
Published: (2019)
Jacobi's solution for geodesics on a triaxial ellipsoid
by: Karney, Charles F. F.
Published: (2025)
by: Karney, Charles F. F.
Published: (2025)
Reconfiguration of unit squares and disks: PSPACE-hardness in simple settings
by: Abrahamsen, Mikkel, et al.
Published: (2024)
by: Abrahamsen, Mikkel, et al.
Published: (2024)
Analysis of self-equilibrated networks through cellular modeling
by: Aloui, Omar, et al.
Published: (2020)
by: Aloui, Omar, et al.
Published: (2020)
The Borsuk number of a graph
by: Cáceres, José, et al.
Published: (2026)
by: Cáceres, José, et al.
Published: (2026)
Mirzakhani's frequencies of simple closed geodesics on hyperbolic surfaces in large genus and with many cusps
by: Ren, Irene
Published: (2023)
by: Ren, Irene
Published: (2023)
Algebraic curves, rich points, and doubly-ruled surfaces
by: Guth, Larry, et al.
Published: (2015)
by: Guth, Larry, et al.
Published: (2015)
How many times can two minimum spanning trees cross?
by: Antić, Todor, et al.
Published: (2026)
by: Antić, Todor, et al.
Published: (2026)
Not all sub-Riemannian minimizing geodesics are smooth
by: Chitour, Yacine, et al.
Published: (2025)
by: Chitour, Yacine, et al.
Published: (2025)
On ergodic properties of geodesic flows on uniform visibility manifolds without conjugate points
by: Wu, Weisheng
Published: (2024)
by: Wu, Weisheng
Published: (2024)
A (Hilbert) geometric algorithm for approximating the halfspace depth of a point in a convex body
by: Gupta, Purvi, et al.
Published: (2024)
by: Gupta, Purvi, et al.
Published: (2024)
On a Nash curve selection lemma through finitely many points
by: Fernando, José F.
Published: (2025)
by: Fernando, José F.
Published: (2025)
Similar Items
-
Computational aspects of disks enclosing many points
by: Bose, Prosenjit, et al.
Published: (2026) -
Approximating shortest paths in weighted square and hexagonal meshes
by: Bose, Prosenjit, et al.
Published: (2024) -
On approximating shortest paths in weighted triangular tessellations
by: Bose, Prosenjit, et al.
Published: (2021) -
Computing shortest paths amid non-overlapping weighted disks
by: Bose, Prosenjit, et al.
Published: (2024) -
On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
by: de Berg, Mark, et al.
Published: (2026)