On-line construction of the upper envelope of triangles and surface patches in three dimensions
From MaRDI portal
Publication:1917040
DOI10.1016/0925-7721(95)00007-0zbMath0849.68119OpenAlexW2031788522MaRDI QIDQ1917040
Jean-Daniel Boissonnat, Katrin Dobrindt
Publication date: 14 July 1996
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0925-7721(95)00007-0
Related Items (5)
Almost tight upper bounds for lower envelopes in higher dimensions ⋮ Fast and efficient computation of additively weighted Voronoi cells for applications in molecular biology ⋮ Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications ⋮ The existence of horizontal envelopes in the 3D-Heisenberg group ⋮ COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
Cites Work
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis
- The upper envelope of piecewise linear functions: Algorithms and applications
- Voronoi diagrams and arrangements
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Applications of random sampling to on-line algorithms in computational geometry
- Ray shooting, depth orders and hidden surface removal
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains
- Almost tight upper bounds for lower envelopes in higher dimensions
- Applications of random sampling in computational geometry. II
- A fast planar partition algorithm. I
- A fast planar partition algorithm, II
- On lazy randomized incremental construction
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On-line construction of the upper envelope of triangles and surface patches in three dimensions
