Pages that link to "Item:Q1338960"
From MaRDI portal
The following pages link to Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960):
Displayed 35 items.
- Straight skeletons and mitered offsets of nonconvex polytopes (Q331386) (← links)
- Querying two boundary points for shortest paths in a polygonal domain (Q419498) (← links)
- Survivable minimum bottleneck networks (Q904084) (← links)
- On overlays and minimization diagrams (Q1014331) (← links)
- The Voronoi diagram of three lines (Q1028584) (← links)
- On determining optimal strategies in pursuit games in the plane (Q1269731) (← links)
- New bounds for lower envelopes in three dimensions, with applications to visibility in terrains (Q1338959) (← links)
- Casting a polyhedron with directional uncertainty (Q1405007) (← links)
- Computing the geodesic centers of a polygonal domain (Q1622342) (← links)
- A near-linear algorithm for the planar segment-center problem (Q1816414) (← 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)
- A lower bound on Voronoi diagram complexity. (Q1853066) (← 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)
- Vertical decompositions for triangles in 3-space (Q1907609) (← links)
- On-line construction of the upper envelope of triangles and surface patches in three dimensions (Q1917040) (← links)
- Anisotropic sources for surface and volume boundary layer mesh generation (Q2123911) (← links)
- The multicriteria \(p\)-facility median location problem on networks (Q2256313) (← links)
- On the complexity of randomly weighted multiplicative Voronoi diagrams (Q2349856) (← links)
- Optimal partitioning for spatiotemporal coverage in a drift field (Q2356660) (← links)
- The geometry of Minkowski spaces -- a survey. II. (Q2571082) (← links)
- Unreliable point facility location problems on networks (Q2636810) (← links)
- On Kinetic Delaunay Triangulations (Q2796411) (← links)
- COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN (Q3373053) (← links)
- The Offset Filtration of Convex Objects (Q3452834) (← links)
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance (Q3511346) (← links)
- Straight Skeletons of Three-Dimensional Polyhedra (Q3541082) (← links)
- VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE (Q4931733) (← links)
- Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)
- (Q5116471) (← links)
- Voronoi Diagrams for Parallel Halflines and Line Segments in Space (Q5136222) (← links)
- Weighted Voronoi Diagrams in the Maximum Norm (Q5241379) (← links)
- Linear approximation of simple objects (Q5890660) (← links)
- Faster algorithms for largest empty rectangles and boxes (Q6174805) (← links)