Imagen de Portada

Dynamic Geometric Connectivity in the Plane with Constant Query Time

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chan, Timothy M., Huang, Zhengcheng
Formato:	Preprint
Publicado:	2024
Materias:	Computational Geometry
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
por: Chan, Timothy M., et al.
Publicado: (2025)

Sparse Bounded Hop-Spanners for Geometric Intersection Graphs
por: Bhore, Sujoy, et al.
Publicado: (2025)

Fully Dynamic Geometric Vertex Cover and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Semialgebraic Range Stabbing, Ray Shooting, and Intersection Counting in the Plane
por: Chan, Timothy M., et al.
Publicado: (2024)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
por: Chan, Timothy M.
Publicado: (2026)

Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
por: Bhore, Sujoy, et al.
Publicado: (2024)

Constant Workspace Algorithms for Computing Relative Hulls in the Plane
por: Chhabra, Himanshu, et al.
Publicado: (2024)

Enclosing Points with Geometric Objects
por: Chan, Timothy M., et al.
Publicado: (2024)

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

Convex Polygon Containment: Improving Quadratic to Near Linear Time
por: Chan, Timothy M., et al.
Publicado: (2024)

Plane Strong Connectivity Augmentation
por: Bessy, Stéphane, et al.
Publicado: (2025)

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

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation
por: Chan, Timothy M., et al.
Publicado: (2025)

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

Further Connectivity Results on Plane Spanning Path Reconfiguration
por: Boucard, Valentino, et al.
Publicado: (2024)

Computing the Girth of a Segment Intersection Graph
por: Chan, Timothy M., et al.
Publicado: (2026)

On Zarankiewicz's Problem for Intersection Hypergraphs of Geometric Objects
por: Chan, Timothy M., et al.
Publicado: (2024)

On Computing Vertex Connectivity of 1-Plane Graphs
por: Biedl, Therese, et al.
Publicado: (2022)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
por: Cheng, Siu-Wing, et al.
Publicado: (2025)

Generalize cross-ratios in n-dimensional Plane-Based Geometric Algebra
por: Harquin, Enzo, et al.
Publicado: (2026)

On $k$-Plane Insertion into Plane Drawings
por: Katheder, Julia, et al.
Publicado: (2024)

On the Connectivity of the Flip Graph of Plane Spanning Paths
por: Kleist, Linda, et al.
Publicado: (2024)

Near-Optimal Dynamic Steiner Spanners for Constant-Curvature Spaces
por: Kisfaludi-Bak, Sándor, et al.
Publicado: (2025)

Dynamic and Streaming Algorithms for Union Volume Estimation
por: Bhore, Sujoy, et al.
Publicado: (2026)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
por: Chan, Timothy M., et al.
Publicado: (2026)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
por: Iacono, John, et al.
Publicado: (2025)

Long Plane Trees
por: Cabello, Sergio, et al.
Publicado: (2021)

Untangling Segments in the Plane
por: da Fonseca, Guilherme D., et al.
Publicado: (2025)

Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Undecidability of Translational Tiling of the Plane with Four Tiles
por: Yang, Chao, et al.
Publicado: (2025)

Undecidability of Translational Tiling of the Plane with Orthogonally Convex Polyominoes
por: Yang, Chao, et al.
Publicado: (2025)

Minimum Plane Bichromatic Spanning Trees
por: Akitaya, Hugo A., et al.
Publicado: (2024)

An Improved Bound for Plane Covering Paths
por: Akitaya, Hugo A., et al.
Publicado: (2025)

A New Approach in Plane Kinematics
por: Goessner, Stefan
Publicado: (2026)

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets
por: Aichholzer, Oswin, et al.
Publicado: (2025)

Sweeping Arrangements of Non-Piercing Curves in Plane
por: Dalal, Suryendu, et al.
Publicado: (2024)

Covering the Euclidean Plane by a Pair of Trees
por: Le, Hung, et al.
Publicado: (2025)

Dynamic Connectivity in Disk Graphs
por: Baumann, Alexander, et al.
Publicado: (2021)

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane
por: Edelsbrunner, Herbert, et al.
Publicado: (2022)

Deciding Connectivity in Symmetric Semi-Algebraic Sets
por: Riener, Cordian., et al.
Publicado: (2025)