An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
From MaRDI portal
Publication:4513199
DOI10.1142/S0218195998000023zbMATH Open0957.68116MaRDI QIDQ4513199FDOQ4513199
Authors: Michael T. Goodrich 
Publication date: 7 November 2000
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)
Cites Work
- On a class of \(O(n^ 2)\) problems in computational geometry
- A linear algorithm for determining the separation of convex polyhedra
- The Parallel Evaluation of General Arithmetic Expressions
- On ray shooting in convex polytopes
- Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number
- Ray shooting in polygons using geodesic triangulations
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Algorithms for ray-shooting and intersection searching
- Ray Shooting and Parametric Search
- A fast algorithm for the Boolean masking problem
- Efficient binary space partitions for hidden-surface removal and solid modeling
- A geometric consistency theorem for a symbolic perturbation scheme
- Ray Shooting Amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions
- A simple parallel tree contraction algorithm
- Lower bounds for algebraic decision trees
- Efficient ray shooting and hidden surface removal
- Dynamic expression trees
- Asymptotic speed-ups in constructive solid geometry
Cited In (2)
This page was built for publication: An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4513199)
