Dynamic C-oriented polygonal intersection searching

DOI10.1016/S0019-9958(84)80011-XMaRDI QIDQ3719843zbMATH OpenOpenAlexFDO

Authors Ralf Hartmut Gueting

Publication date 1984

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(84)80011-x

zbMATH Keywords

c-oriented polygonscomputational geometryquery polygon

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The intersection searching problem for c-oriented polygons
• Connected component and simple polygon intersection searching
• Connected component and simple polygon intersection searching
• scientific article; zbMATH DE number 3911725
• Reporting Intersections of Polygons

Cited in

(13)

• Efficient \(c\)-oriented range searching with DOP-trees
• Optimization on directionally convex sets
• Fast dynamic intersection searching in a set of isothetic line segments
• On some union and intersection problems for polygons with fixed orientations
• Fundamentals of restricted-orientation convexity
• Optimal computation of finitely oriented convex hulls
• A dynamic fixed windowing problem
• scientific article; zbMATH DE number 3911725 (Why is no real title available?)
• PLANAR STRONG VISIBILITY
• Connected component and simple polygon intersection searching
• Algorithms – ESA 2005
• Dominance for enclosure problems
• The intersection searching problem for c-oriented polygons

This page was built for publication: Dynamic C-oriented polygonal intersection searching

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