The intersection searching problem for c-oriented polygons

DOI10.1016/0020-0190(91)90189-OMaRDI QIDQ751326zbMATHOpenAlexFDO

Authors Xuehou Tan, Tomio Hirata, Yasuyoshi Inagaki

Publication date 1991

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90189-o

zbMATH Keywords

computational geometrygeometric searchingoriented polygonsPolygon intersection

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Dynamic C-oriented polygonal intersection searching
• GENERALIZED INTERSECTION SEARCHING PROBLEMS
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Connected component and simple polygon intersection searching
• Connected component and simple polygon intersection searching

Cites work

• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Dynamic C-oriented polygonal intersection searching
• Filtering Search: A New Approach to Query-Answering
• Halfplanar range search in linear space and \(O(n^{0.695})\) query time
• Linear space data structures for two types of range search
• New algorithms for special cases of the hidden line elimination problem
• Optimal computation of finitely oriented convex hulls
• Point retrieval for polygons
• Polygonal intersection searching

Cited in

(4)

• Computing minimum length paths of a given homotopy class
• A local search algorithm for ray-convex polyhedron intersection
• Combinatorial Geometry and Graph Theory
• Dynamic C-oriented polygonal intersection searching

This page was built for publication: The intersection searching problem for c-oriented polygons

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