Shooting permanent rays among disjoint polygons in the plane

DOI10.1145/1542362.1542372MaRDI QIDQ5370699zbMATH OpenOpenAlexWikidataFDO

Authors Mashhood Ishaque, Bettina Speckmann, Csaba D. Tóth

Publication date 20 October 2017

Published in Proceedings of the twenty-fifth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/54c3fcde-0955-4a96-8a28-992ae6069c36

zbMATH Keywords

dynamic data structuresegment insertionbinary space partitionconvex partitionray shooting

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Shooting permanent rays among disjoint polygons in the plane
• Ray Shooting Amidst Convex Polygons in 2D
• scientific article; zbMATH DE number 176772
• Linear data structures for fast ray-shooting amidst convex polyhedra
• A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk

Cited in

(6)

• On ray shooting in convex polytopes
• Binary plane partitions for disjoint line segments
• Hierarchical decompositions and circular ray shooting in simple polygons
• Relative convex hulls in semi-dynamic arrangements
• Convex partitions with 2-edge connected dual graphs
• Shooting permanent rays among disjoint polygons in the plane

This page was built for publication: Shooting permanent rays among disjoint polygons in the plane

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