INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS

DOI10.1142/S0218195999000327MaRDI QIDQ4682199zbMATH OpenOpenAlexFDO

Authors Fabrizio d'Amore, Roberto Giaccio

Publication date 10 June 2005

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218195999000327

zbMATH Keywords

Segment intersectionboundary updatehive graphpersistent lists

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Dynamic orthogonal segment intersection search
• Efficient dynamic algorithms for some geometric intersection problems
• Fast dynamic intersection searching in a set of isothetic line segments
• Connected component and simple polygon intersection searching
• Dynamic Point Location in General Subdivisions

Cites work

• Efficient dynamic algorithms for some geometric intersection problems
• Filtering Search: A New Approach to Query-Answering
• Making data structures persistent
• New Results on Dynamic Planar Point Location
• Optimal Point Location in a Monotone Subdivision
• Segments, rectangles, contours

Cited in

(1)

• Efficient maintenance of the union of intervals on a line, with applications

This page was built for publication: INTERSECTION PROBLEMS ON SEGMENTS UNDER BOUNDARY UPDATES WITH APPLICATION TO PERSISTENT LISTS

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