Pages that link to "Item:Q919829"

The following pages link to The upper envelope of piecewise linear functions: Tight bounds on the number of faces (Q919829):

Displaying 13 items.

• Finding the upper envelope of n line segments in O(n log n) time (Q582095) (← links)
• The complexity of many cells in arrangements of planes and related problems (Q582901) (← links)
• The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis (Q810525) (← links)
• The upper envelope of piecewise linear functions: Algorithms and applications (Q919830) (← links)
• On overlays and minimization diagrams (Q1014331) (← links)
• A role of lower semicontinuous functions in the combinatorial complexity of geometric problems (Q1179028) (← links)
• Quasi-optimal upper bounds for simplex range searching and new zone theorems (Q1201746) (← links)
• Almost tight upper bounds for lower envelopes in higher dimensions (Q1338960) (← links)
• Remarks on the computation of the horizon of a digital terrain (Q1412555) (← links)
• A new technique for analyzing substructures in arrangements of piecewise linear surfaces (Q1816466) (← links)
• Vertical decompositions for triangles in 3-space (Q1907609) (← links)
• On the two-dimensional Davenport-Schinzel problem (Q2638785) (← links)
• Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications (Q5057426) (← links)