The intersection searching problem for c-oriented polygons

DOI10.1016/0020-0190(91)90189-OzbMath0714.68104OpenAlexW2079594818MaRDI QIDQ751326

Tomio Hirata, Xue-Hou Tan, 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)

Related Items

Computing minimum length paths of a given homotopy class

Cites Work

• Unnamed Item
• Unnamed Item
• Linear space data structures for two types of range search
• Halfplanar range search in linear space and \(O(n^{0.695})\) query time
• Polygonal intersection searching
• Optimal computation of finitely oriented convex hulls
• Dynamic C-oriented polygonal intersection searching
• Filtering Search: A New Approach to Query-Answering
• Point retrieval for polygons
• New algorithms for special cases of the hidden line elimination problem