Computing Envelopes in Four Dimensions with Applications
- 1 December 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 26 (6) , 1714-1732
- https://doi.org/10.1137/s0097539794265724
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Efficient randomized algorithms for some geometric optimization problemsDiscrete & Computational Geometry, 1996
- On-line construction of the upper envelope of triangles and surface patches in three dimensionsComputational Geometry, 1996
- The overlay of lower envelopes and its applicationsDiscrete & Computational Geometry, 1996
- Applications of Parametric Searching in Geometric OptimizationJournal of Algorithms, 1994
- On the number of views of polyhedral terrainsDiscrete & Computational Geometry, 1994
- On range searching with semialgebraic setsDiscrete & Computational Geometry, 1994
- Algorithms for bichromatic line-segment problems and polyhedral terrainsAlgorithmica, 1994
- Ray Shooting and Parametric SearchSIAM Journal on Computing, 1993
- Applications of random sampling to on-line algorithms in computational geometryDiscrete & Computational Geometry, 1992
- Triangles in space or building (and analyzing) castles in the airCombinatorica, 1990