Ray Shooting Amidst Convex Polygons in 2D
From MaRDI portal
Publication:3837381
Recommendations
Cited in
(27)- The maximin line problem with regional demand
- Linear Data Structures for Fast Ray-Shooting Amidst Convex Polyhedra
- Properties of a level set algorithm for the visibility problems
- Reporting intersecting pairs of convex polytopes in two and three dimensions
- Circle Shooting in a Simple Polygon
- Locating an obnoxious line among planar objects
- Highway hull revisited
- Ray shooting from convex ranges
- Algorithms for subpath convex hull queries and ray-shooting among segments
- Free-form surface partition in 3-d
- Shooting permanent rays among disjoint polygons in the plane
- Simplex Range Searching and Its Variants: A Review
- Shooting permanent rays among disjoint polygons in the plane
- scientific article; zbMATH DE number 437529 (Why is no real title available?)
- A partial differential equation obstacle problem for the level set approach to visibility
- Information-seeking control under visibility-based uncertainty
- On ray shooting in convex polytopes
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Visibility and its dynamics in a PDE based implicit framework
- Multiview visibility estimation for image-based modeling
- PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- Hierarchical decompositions and circular ray shooting in simple polygons
- Ray shooting amid balls, farthest point from a line, and range emptiness searching
- scientific article; zbMATH DE number 437551 (Why is no real title available?)
- Visibility and ray shooting queries in polygonal domains
- scientific article; zbMATH DE number 176772 (Why is no real title available?)
This page was built for publication: Ray Shooting Amidst Convex Polygons in 2D
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837381)