Imagen de Portada

Optimistic Imprecise Shortest Watchtower in 1.5D and 2.5D

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	McCoy, Bradley, Zhu, Binhai
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

Parametric Shortest Paths in a Linearly Interpolated Graph
por: Sriraman, Jacob, et al.
Publicado: (2026)

Optimal Bridge, Twin Bridges and Beyond: Inserting Edges into a Road Network to Minimize the Constrained Diameters
por: Feng, Zhidan, et al.
Publicado: (2024)

Local umbilic, convexity and cylindrical estimates for fully nonlinear curvature flows
por: Langford, Mat, et al.
Publicado: (2025)

Instance-Optimal Imprecise Convex Hull
por: de Berg, Sarita, et al.
Publicado: (2025)

On the generalised ideal flow of closed planar curves
por: McCoy, James, et al.
Publicado: (2026)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
por: de Berg, Sarita, et al.
Publicado: (2026)

Shortest Paths of Mutually Visible Robots
por: Alsaedi, Rusul J., et al.
Publicado: (2023)

Shortest Paths in Geodesic Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2026)

Shortest Paths, Convexity, and Treewidth in Regular Hyperbolic Tilings
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

Algorithms for the Shortest Vector Problem in $2$-dimensional Lattices, Revisited
por: Zhao, Lihao, et al.
Publicado: (2025)

Counting of Shortest Paths in Cubic Grid
por: Dutt, Mousumi, et al.
Publicado: (2018)

Finding a Shortest Curve that Separates Few Objects from Many
por: Biedl, Therese, et al.
Publicado: (2025)

Shortest Paths on Convex Polyhedral Surfaces
por: Wang, Haitao
Publicado: (2025)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
por: de Berg, Mark, et al.
Publicado: (2025)

Shortest Path Separators in Unit Disk Graphs
por: Harb, Elfarouk, et al.
Publicado: (2024)

An Optimal Algorithm for Shortest Paths in Unweighted Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2025)

Structural Properties of Shortest Flip Sequences Between Plane Spanning Trees
por: Aichholzer, Oswin, et al.
Publicado: (2026)

Not-So-Strange Love: Language Models and Generative Linguistic Theories are More Compatible than They Appear
por: McCoy, R. Thomas
Publicado: (2026)

Single-Source Shortest Path Problem in Weighted Disk Graphs
por: An, Shinwoo, et al.
Publicado: (2025)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
por: Brewer, Bruce W., et al.
Publicado: (2024)

GASP: A Gradient-Aware Shortest Path Algorithm for Boundary-Confined Visualization of 2-Manifold Reeb Graphs
por: Rahman, Sefat E., et al.
Publicado: (2025)

Freeze-Tag is NP-hard in 2D with $L_1$ distance
por: Silva, Lucas de Oliveira, et al.
Publicado: (2025)

Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
por: Ahrens, Markus, et al.
Publicado: (2021)

Bounding Shortest Closed Geodesics with Diameter on compact 2-dimensional Orbifolds Homeomorphic to $S^2$
por: Chen, Jinxuan
Publicado: (2024)

Filling holes in LoD2 building models
por: Gao, Weixiao, et al.
Publicado: (2024)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
por: de Berg, Sarita, et al.
Publicado: (2023)

Complexity of 2D Snake Cube Puzzles
por: MIT Hardness Group, et al.
Publicado: (2024)

Technical Services and the Internet.
por: McCoy, Patricia Sayre
Publicado: (1995)

Polynomial 2D Green Coordinates for High-order Cages
por: Liu, Shibo, et al.
Publicado: (2024)

An open-source heuristic to reboot 2D nesting research
por: Gardeyn, Jeroen, et al.
Publicado: (2025)

A faster algorithm for the Fréchet distance in 1D for the imbalanced case
por: Blank, Lotte, et al.
Publicado: (2024)

Fast Fiber Line Extraction for 2D Bivariate Scalar Fields
por: Raith, Felix, et al.
Publicado: (2023)

Transforming Dogs on the Line: On the Fréchet Distance Under Translation or Scaling in 1D
por: Blank, Lotte, et al.
Publicado: (2025)

Outperforming the Best 1D Low-Discrepancy Constructions with a Greedy Algorithm
por: Clément, François
Publicado: (2024)

A Constant-Factor Approximation for Continuous Dynamic Time Warping in 2D
por: Buchin, Kevin, et al.
Publicado: (2026)

Evaluating the Usage of African-American Vernacular English in Large Language Models
por: Dunlap, Deja, et al.
Publicado: (2026)

Designing 3D Anisotropic Frame Fields with Odeco Tensors
por: Zhu, Haikuan, et al.
Publicado: (2025)

Fundamentals of Computing Continuous Dynamic Time Warping in 2D under Different Norms
por: Buchin, Kevin, et al.
Publicado: (2025)

Fusing in 3D: Free-Viewpoint Fusion Rendering with a 3D Infrared-Visible Scene Representation
por: Yang, Chao, et al.
Publicado: (2026)

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
por: McCoy, Hunter, et al.
Publicado: (2025)