Circle-segment intersection queries in connected geometric graphs

DOI10.4230/LIPICS.ISAAC.2025.3MaRDI QIDQ7364337zbMATH OpenFDO

Authors Peyman Afshani, Yannick Bosch, Sabine Storandt

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.3

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Approximate Map Matching with respect to the Fréchet Distance
• Connected component and simple polygon intersection searching
• Convexity helps iterated search in 3D
• Fast detection of polyhedral intersection
• Fractional cascading. I: A data structuring technique
• Greedy spanners in Euclidean spaces admit sublinear separators
• scientific article; zbMATH DE number 177829 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Lowest common ancestors in trees and directed acyclic graphs
• On intersection searching problems involving curved objects
• Reporting red-blue intersections between two sets of connected line segments

This page was built for publication: Circle-segment intersection queries in connected geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7364337)