Computing Envelopes in Four Dimensions with Applications
From MaRDI portal
Publication:4376194
DOI10.1137/S0097539794265724zbMath0885.68072OpenAlexW2019524783MaRDI QIDQ4376194
Micha Sharir, Pankaj K. Agarwal, Boris Aronov
Publication date: 10 February 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539794265724
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Almost tight upper bounds for lower envelopes in higher dimensions ⋮ The Offset Filtration of Convex Objects ⋮ Exact computation of the medial axis of a polyhedron ⋮ APPROXIMATING THE DIAMETER, WIDTH, SMALLEST ENCLOSING CYLINDER, AND MINIMUM-WIDTH ANNULUS ⋮ Computing constrained minimum-width annuli of point sets ⋮ Querying two boundary points for shortest paths in a polygonal domain ⋮ Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance ⋮ Continuous location of dimensional structures. ⋮ Lines avoiding balls in three dimensions revisited ⋮ The \(k\)-centrum straight-line location problem ⋮ APPROXIMATING 3D POINTS WITH CYLINDRICAL SEGMENTS ⋮ VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE ⋮ Unnamed Item ⋮ Minimum-width annulus with outliers: circular, square, and rectangular cases ⋮ On overlays and minimization diagrams ⋮ Unnamed Item ⋮ Faster algorithms for growing prioritized disks and rectangles
