Imagen de Portada

In the Search for Good Neck Cuts

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ruggerio, Sam, Har-Peled, Sariel
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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)

A Practical Approach for Computing the Diameter of a Point Set
por: Har-Peled, Sariel
Publicado: (2025)

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

Judíos, indios y el mito del crimen ritual. El caso de Chamula, Chiapas, 1868
por: Misgav Har-Peled
Publicado: (2015)

Minimum Partition of Polygons under Width and Cut Constraints
por: Chung, Jaehoon, et al.
Publicado: (2025)

An Interface Tracking Method with Triangle Edge Cuts
por: Wang, Mengdi, et al.
Publicado: (2024)

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
por: Bui, Hong Duc
Publicado: (2025)

FSM Builder: A Tool for Writing Autograded Finite Automata Questions
por: Robson, Eliot Wong, et al.
Publicado: (2024)

Variable Min-Cut Max-Flow Bounds and Algorithms in Finite Regime
por: Gitik, Rivka, et al.
Publicado: (2025)

Product Range Search Problem
por: Chubet, Oliver, et al.
Publicado: (2026)

Searching in Euclidean Spaces with Predictions
por: Cabello, Sergio, et al.
Publicado: (2024)