scientific article
From MaRDI portal
Publication:3140401
zbMath0801.68159MaRDI QIDQ3140401
J. E. Hershberger, Subhash Suri
Publication date: 4 December 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Distributed algorithms (68W15)
Related Items (9)
On range searching with semialgebraic sets ⋮ Distance measures on intersecting objects and their applications ⋮ Rectilinear decompositions with low stabbing number ⋮ Computing depth orders and related problems ⋮ Computing a shortest watchman path in a simple polygon in polynomial-time ⋮ Computing depth orders for fat objects and related problems ⋮ Rectangulating rectilinear polygons in parallel ⋮ Optimal output-sensitive convex hull algorithms in two and three dimensions ⋮ Efficient visibility queries in simple polygons
This page was built for publication:
