Imagen de Portada

A Practical Approach for Computing the Diameter of a Point Set

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Har-Peled, Sariel
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

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
por: Barequet, Gill, et al.
Publicado: (2025)

A Simple Proof of the Existence of a Planar Separator
por: Har-Peled, Sariel
Publicado: (2011)

The Complexity of One or Many Faces in the Overlay of Many Arrangements
por: Har-Peled, Sariel
Publicado: (2025)

An Output Sensitive Algorithm for Discrete Convex Hulls
por: Har-Peled, Sariel
Publicado: (2026)

Separator for $c$-Packed Segments and Curves
por: Har-Peled, Sariel
Publicado: (2026)

How to Get Close to the Median Shape
por: Har-Peled, Sariel
Publicado: (2026)

The Prophet and the Voronoi Diagram
por: Har-Peled, Sariel
Publicado: (2026)

Bifurcation: How to Explore a Tree
por: Har-Peled, Sariel
Publicado: (2025)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
por: Barequet, Gill, et al.
Publicado: (2025)

Approximately: Independence Implies Vertex Cover
por: Har-Peled, Sariel
Publicado: (2023)

Orthogonal Emptiness Queries for Random Points
por: Dullerud, Jonathan E., et al.
Publicado: (2025)

Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
por: Har-Peled, Sariel, et al.
Publicado: (2014)

Approximating Densest Subgraph in Geometric Intersection Graphs
por: Har-Peled, Sariel, et al.
Publicado: (2024)

How Packed Is It, Really?
por: Har-Peled, Sariel, et al.
Publicado: (2021)

Near-Optimal Euclidean Locality-Sensitive Orderings
por: Gao, Zhimeng, et al.
Publicado: (2023)

In the Search for Good Neck Cuts
por: Ruggerio, Sam, et al.
Publicado: (2026)

Proof of Dudley's Convex Approximation
por: Har-Peled, Sariel, et al.
Publicado: (2019)

The Road to the Closest Point is Paved by Good Neighbors
por: Har-Peled, Sariel, et al.
Publicado: (2025)

Improving the average dilation of a metric graph by adding edges
por: Har-Peled, Sariel, et al.
Publicado: (2025)

New Constructions of SSPDs and their Applications
por: Abam, Mohammad A., et al.
Publicado: (2025)

No-dimensional Tverberg Partitions Revisited
por: Har-Peled, Sariel, et al.
Publicado: (2023)

Dependable Spanners via Unreliable Edges
por: Har-Peled, Sariel, et al.
Publicado: (2024)

Fast Approximation Algorithms for Piercing Boxes by Points
por: Agarwal, Pankaj K., et al.
Publicado: (2023)

The Fréchet Distance Unleashed: Approximating a Dog with a Frog
por: Har-Peled, Sariel, et al.
Publicado: (2024)

Well-Separated Pairs Decomposition Revisited
por: Har-Peled, Sariel, et al.
Publicado: (2025)

On Small Pair Decompositions for Point Sets
por: Buchin, Kevin, et al.
Publicado: (2026)

Graph-Based Nearest-Neighbor Search without the Spread
por: Giliberti, Jeff, et al.
Publicado: (2026)

An Easy Proof of a Weak Version of Chernoff inequality
por: Har-Peled, Sariel
Publicado: (2025)

Quickly Avoiding a Random Catastrophe
por: Ashur, Stav, et al.
Publicado: (2025)

Oracle-Augmented Prophet Inequalities
por: Har-Peled, Sariel, et al.
Publicado: (2024)

Charting the Diameter Computation Landscape on Intersection Graphs in the Plane
por: Chan, Timothy M., et al.
Publicado: (2026)

Faster Motion Planning via Restarts
por: Amato, Nancy, et al.
Publicado: (2025)

Computing Largest Subsets of Points Whose Convex Hulls have Bounded Area and Diameter
por: Picarella, Gianmarco, et al.
Publicado: (2025)

Edge Nearest Neighbor in Sampling-Based Motion Planning
por: Ashur, Stav, et al.
Publicado: (2025)

On Triangular Separation of Bichromatic Point Sets
por: Bergold, Helena, et al.
Publicado: (2025)

Visual Complexity of Point Set Mappings
por: Meulemans, Wouter, et al.
Publicado: (2024)

Edge-Constrained Hamiltonian Paths on a Point Set
por: Antić, Todor, et al.
Publicado: (2025)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Capturing the Shape of a Point Set with a Line Segment
por: van Beusekom, Nathan, et al.
Publicado: (2024)

Asymmetric Separation Problem for Bichromatic Point Set
por: Maji, Sukanya, et al.
Publicado: (2024)