Direct dynamic structures for some line segment problems

DOI10.1016/0734-189X(83)90111-1MaRDI QIDQ3709910zbMATH OpenOpenAlexFDO

Authors Gaston H. Gonnet, J. Ian Munro, D. Wood

Publication date 1983

Published in Computer Vision, Graphics, and Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0734-189x(83)90111-1

zbMATH Keywords

binary search treesdata structuredynamic binary tree structuresdynamic problems in computational geometrydynamical environmentoverlapping lines in aqueryingsearchingupdating

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Dynamic Point Location in General Subdivisions
• Storing line segments in partition trees
• Fast dynamic intersection searching in a set of isothetic line segments
• Dynamic orthogonal segment intersection search
• scientific article; zbMATH DE number 742971

Cited in

(3)

• Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects
• scientific article; zbMATH DE number 1691485 (Why is no real title available?)
• Union-copy structures and dynamic segment trees

This page was built for publication: Direct dynamic structures for some line segment problems

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