Pages that link to "Item:Q1338959"
From MaRDI portal
The following pages link to New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959):
Displaying 16 items.
- On the complexity of sets of free lines and line segments among balls in three dimensions (Q420577) (← links)
- Notes on the complexity of exact view graph algorithms for piecewise smooth algebraic surfaces (Q1275661) (← links)
- On the number of views of polyhedral terrains (Q1334930) (← links)
- On lines missing polyhedral sets in 3-space (Q1334933) (← links)
- Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- Efficient randomized algorithms for some geometric optimization problems (Q1816458) (← links)
- A new technique for analyzing substructures in arrangements of piecewise linear surfaces (Q1816466) (← links)
- Almost tight upper bounds for the single cell and zone problems in the three dimensions (Q1906044) (← links)
- The overlay of lower envelopes and its applications (Q1907607) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- On topological changes in the Delaunay triangulation of moving points (Q2391707) (← links)
- Unreliable point facility location problems on networks (Q2636810) (← links)
- On Kinetic Delaunay Triangulations (Q2796411) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- Computing fair and bottleneck matchings in geometric graphs (Q6487431) (← links)
