scientific article; zbMATH DE number 176772
From MaRDI portal
Publication:4036602
zbMATH Open0769.68119MaRDI QIDQ4036602FDOQ4036602
Authors: Jack Snoeyink, Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas Guibas, John Hershberger, Micha Sharir 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (21)
- A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
- On ray shooting in convex polytopes
- Separating translates in the plane: Combinatorial bounds and an algorithm
- Hierarchical decompositions and circular ray shooting in simple polygons
- Efficient ray shooting and hidden surface removal
- Rectangulating rectilinear polygons in parallel
- Title not available (Why is that?)
- Throwing Stones Inside Simple Polygons
- Applications of a new space-partitioning technique
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Circle Shooting in a Simple Polygon
- Linear data structures for fast ray-shooting amidst convex polyhedra
- Title not available (Why is that?)
- Rectilinear decompositions with low stabbing number
- Computing depth orders and related problems
- Title not available (Why is that?)
- Visibility and Ray Shooting Queries in Polygonal Domains
- An optimal algorithm for the boundary of a cell in a union of rays
- Intersection queries in sets of disks
- Efficient piecewise-linear function approximation using the uniform metric
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4036602)
