On ray shooting in convex polytopes
From MaRDI portal
Publication:685183
DOI10.1007/BF02573975zbMATH Open0776.68110MaRDI QIDQ685183FDOQ685183
Publication date: 30 September 1993
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131271
Recommendations
- scientific article; zbMATH DE number 437551
- Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
- scientific article
- Ray shooting in polygons using geodesic triangulations
- Ray Shooting Amidst Convex Polygons in 2D
- On ray shooting for triangles in 3-space and related problems
- Ray Shooting Amidst Spheres in Three Dimensions and Related Problems
- Shooting permanent rays among disjoint polygons in the plane
- Shooting permanent rays among disjoint polygons in the plane
- Ray shooting from convex ranges
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- \(\epsilon\)-nets and simplex range queries
- Efficient partition trees
- New applications of random sampling in computational geometry
- Applications of random sampling in computational geometry. II
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Decomposable searching problems I. Static-to-dynamic transformation
- Reporting points in halfspaces
- Cutting hyperplanes for divide-and-conquer
- Lower Bounds on the Complexity of Polytope Range Searching
- A Randomized Algorithm for Closest-Point Queries
- Euclidean minimum spanning trees and bichromatic closest pairs
- Small-dimensional linear programming and convex hulls made easy
- How to search in history
- Point location among hyperplanes and unidirectional ray-shooting
- Efficient ray shooting and hidden surface removal
- On vertical ray shooting in arrangements
- Title not available (Why is that?)
Cited In (27)
- All-maximum and all-minimum problems under some measures
- New lower bounds for Hopcroft's problem
- Approximate Polytope Membership Queries
- APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS
- Ray Shooting and Parametric Search
- Hierarchical decompositions and circular ray shooting in simple polygons
- Kinetic sorting and kinetic convex hulls
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
- Output-sensitive results on convex hulls, extreme points, and related problems
- A deterministic algorithm for the three-dimensional diameter problem
- Point location in zones of \(k\)-flats in arrangements
- Algorithms for generalized halfspace range searching and other intersection searching problems
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- A tight lower bound for computing the diameter of a 3D convex polytope
- Range minima queries with respect to a random permutation, and approximate range counting
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Extremal point queries with lines and line segments and related problems
- A fast method for obtaining convex combination coefficients
- Simplex Range Searching and Its Variants: A Review
- An Output-Sensitive Convex Hull Algorithm for Planar Objects
- Optimal partition trees
- Title not available (Why is that?)
- Economical Delone Sets for Approximating Convex Bodies
- On Ray Shooting for Triangles in 3-Space and Related Problems
- Minimum-width double-slabs and widest empty slabs in high dimensions
- An efficient algorithm for the three-dimensional diameter problem
- Title not available (Why is that?)
This page was built for publication: On ray shooting in convex polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685183)
